This is from Discrete Mathematics and its applications

I was able to get sum pretty easy.
I am trying to follow this example in the book to get the product of the two binary numbers

Here's my work so far 
I got the expected output from my calculator windows application. Does anyone see what the issue is? The problem starts when I don't get 7 zeros separating the first two ones. What would you do with the end result, 8? I am still not sure about that.
One very easy way to get your desired product is to convert both numbers to base $10$ and then to multiply them and then to express that product in base $2$. It's not the cleanest thing to do in the world, but neither is your approach. Consider that $$ (1000111)_2 = 1(2^6)+1(2^2)+1(2)+1 = 71, $$ and $$ (1110111)_2 = 1(2^6)+1(2^5)+1(2^4)+1(2^2)+1(2)+1 = 119. $$ Thus, we have that $$ (1000111)_2 \cdot (1110111)_2 = 71\cdot 119 = 8449. $$ Now simply convert $8449$ into base $2$: $$ 8449 = 1(2^{13})+1(2^8)+1 = (10000100000001)_2. $$ Thus, we see that $$ (1000111)_2 \cdot (1110111)_2 = (10000100000001)_2. $$