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;
- 100 222 222 344 ÷ 2 = 50 111 111 172 + 0;
- 50 111 111 172 ÷ 2 = 25 055 555 586 + 0;
- 25 055 555 586 ÷ 2 = 12 527 777 793 + 0;
- 12 527 777 793 ÷ 2 = 6 263 888 896 + 1;
- 6 263 888 896 ÷ 2 = 3 131 944 448 + 0;
- 3 131 944 448 ÷ 2 = 1 565 972 224 + 0;
- 1 565 972 224 ÷ 2 = 782 986 112 + 0;
- 782 986 112 ÷ 2 = 391 493 056 + 0;
- 391 493 056 ÷ 2 = 195 746 528 + 0;
- 195 746 528 ÷ 2 = 97 873 264 + 0;
- 97 873 264 ÷ 2 = 48 936 632 + 0;
- 48 936 632 ÷ 2 = 24 468 316 + 0;
- 24 468 316 ÷ 2 = 12 234 158 + 0;
- 12 234 158 ÷ 2 = 6 117 079 + 0;
- 6 117 079 ÷ 2 = 3 058 539 + 1;
- 3 058 539 ÷ 2 = 1 529 269 + 1;
- 1 529 269 ÷ 2 = 764 634 + 1;
- 764 634 ÷ 2 = 382 317 + 0;
- 382 317 ÷ 2 = 191 158 + 1;
- 191 158 ÷ 2 = 95 579 + 0;
- 95 579 ÷ 2 = 47 789 + 1;
- 47 789 ÷ 2 = 23 894 + 1;
- 23 894 ÷ 2 = 11 947 + 0;
- 11 947 ÷ 2 = 5 973 + 1;
- 5 973 ÷ 2 = 2 986 + 1;
- 2 986 ÷ 2 = 1 493 + 0;
- 1 493 ÷ 2 = 746 + 1;
- 746 ÷ 2 = 373 + 0;
- 373 ÷ 2 = 186 + 1;
- 186 ÷ 2 = 93 + 0;
- 93 ÷ 2 = 46 + 1;
- 46 ÷ 2 = 23 + 0;
- 23 ÷ 2 = 11 + 1;
- 11 ÷ 2 = 5 + 1;
- 5 ÷ 2 = 2 + 1;
- 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.
100 222 222 344(10) = 1 0111 0101 0101 1011 0101 1100 0000 0000 1000(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 37.
- 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) indicates 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, 37,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 64.
4. Get the positive binary computer representation on 64 bits (8 Bytes):
If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 64.
Decimal Number 100 222 222 344(10) converted to signed binary in one's complement representation: