1. Divide the number repeatedly by 2:
Keep track of each remainder.
We stop when we get a quotient that is equal to zero.
- division = quotient + remainder;
- 101 100 008 ÷ 2 = 50 550 004 + 0;
- 50 550 004 ÷ 2 = 25 275 002 + 0;
- 25 275 002 ÷ 2 = 12 637 501 + 0;
- 12 637 501 ÷ 2 = 6 318 750 + 1;
- 6 318 750 ÷ 2 = 3 159 375 + 0;
- 3 159 375 ÷ 2 = 1 579 687 + 1;
- 1 579 687 ÷ 2 = 789 843 + 1;
- 789 843 ÷ 2 = 394 921 + 1;
- 394 921 ÷ 2 = 197 460 + 1;
- 197 460 ÷ 2 = 98 730 + 0;
- 98 730 ÷ 2 = 49 365 + 0;
- 49 365 ÷ 2 = 24 682 + 1;
- 24 682 ÷ 2 = 12 341 + 0;
- 12 341 ÷ 2 = 6 170 + 1;
- 6 170 ÷ 2 = 3 085 + 0;
- 3 085 ÷ 2 = 1 542 + 1;
- 1 542 ÷ 2 = 771 + 0;
- 771 ÷ 2 = 385 + 1;
- 385 ÷ 2 = 192 + 1;
- 192 ÷ 2 = 96 + 0;
- 96 ÷ 2 = 48 + 0;
- 48 ÷ 2 = 24 + 0;
- 24 ÷ 2 = 12 + 0;
- 12 ÷ 2 = 6 + 0;
- 6 ÷ 2 = 3 + 0;
- 3 ÷ 2 = 1 + 1;
- 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.
101 100 008(10) = 110 0000 0110 1010 1001 1110 1000(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 27.
A signed binary's bit length must be equal to a power of 2, as of:
21 = 2; 22 = 4; 23 = 8; 24 = 16; 25 = 32; 26 = 64; ...
The first bit (the leftmost) is reserved for the sign:
0 = positive integer number, 1 = negative integer number
The least number that is:
1) a power of 2
2) and is larger than the actual length, 27,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 32.
4. Get the positive binary computer representation on 32 bits (4 Bytes):
If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 32:
Number 101 100 008(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
101 100 008(10) = 0000 0110 0000 0110 1010 1001 1110 1000
Spaces were used to group digits: for binary, by 4, for decimal, by 3.