What are the required steps to convert base 10 decimal system
number 536 905 964 to base 2 unsigned binary equivalent?
- A number written in base ten, or a decimal system number, is a number written using the digits 0 through 9. A number written in base two, or a binary system number, is a number written using only the digits 0 and 1.
1. Divide the number repeatedly by 2:
Keep track of each remainder.
Stop when you get a quotient that is equal to zero.
- division = quotient + remainder;
- 536 905 964 ÷ 2 = 268 452 982 + 0;
- 268 452 982 ÷ 2 = 134 226 491 + 0;
- 134 226 491 ÷ 2 = 67 113 245 + 1;
- 67 113 245 ÷ 2 = 33 556 622 + 1;
- 33 556 622 ÷ 2 = 16 778 311 + 0;
- 16 778 311 ÷ 2 = 8 389 155 + 1;
- 8 389 155 ÷ 2 = 4 194 577 + 1;
- 4 194 577 ÷ 2 = 2 097 288 + 1;
- 2 097 288 ÷ 2 = 1 048 644 + 0;
- 1 048 644 ÷ 2 = 524 322 + 0;
- 524 322 ÷ 2 = 262 161 + 0;
- 262 161 ÷ 2 = 131 080 + 1;
- 131 080 ÷ 2 = 65 540 + 0;
- 65 540 ÷ 2 = 32 770 + 0;
- 32 770 ÷ 2 = 16 385 + 0;
- 16 385 ÷ 2 = 8 192 + 1;
- 8 192 ÷ 2 = 4 096 + 0;
- 4 096 ÷ 2 = 2 048 + 0;
- 2 048 ÷ 2 = 1 024 + 0;
- 1 024 ÷ 2 = 512 + 0;
- 512 ÷ 2 = 256 + 0;
- 256 ÷ 2 = 128 + 0;
- 128 ÷ 2 = 64 + 0;
- 64 ÷ 2 = 32 + 0;
- 32 ÷ 2 = 16 + 0;
- 16 ÷ 2 = 8 + 0;
- 8 ÷ 2 = 4 + 0;
- 4 ÷ 2 = 2 + 0;
- 2 ÷ 2 = 1 + 0;
- 1 ÷ 2 = 0 + 1;
2. Construct the base 2 representation of the positive number:
Take all the remainders starting from the bottom of the list constructed above.
536 905 964(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:
536 905 964 (base 10) = 10 0000 0000 0000 1000 1000 1110 1100 (base 2)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.