Example 3 Consider the conversion of the denary number, 35 000, into a 16-bit binary number:
2. Subtract the largest possible power of 2 and keep doing this until the value 0 is reached
3. This will give us the following 16-bit binary number: 1 0 0 0 0 0 0 1 0 0 0 1 1 1 1 0
5. Successive division by 2
6. Write the result of the division including the remainder (even if it is 0) under the 35 000
7. Keep dividing until the result is zero
8. Write down all the remainders in reverse order to get the binary number: 1 0 0 0 1 0 0 0 1 0 1 1 1 0 0 0