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 011 110 005 ÷ 2 = 50 505 555 002 + 1;
- 50 505 555 002 ÷ 2 = 25 252 777 501 + 0;
- 25 252 777 501 ÷ 2 = 12 626 388 750 + 1;
- 12 626 388 750 ÷ 2 = 6 313 194 375 + 0;
- 6 313 194 375 ÷ 2 = 3 156 597 187 + 1;
- 3 156 597 187 ÷ 2 = 1 578 298 593 + 1;
- 1 578 298 593 ÷ 2 = 789 149 296 + 1;
- 789 149 296 ÷ 2 = 394 574 648 + 0;
- 394 574 648 ÷ 2 = 197 287 324 + 0;
- 197 287 324 ÷ 2 = 98 643 662 + 0;
- 98 643 662 ÷ 2 = 49 321 831 + 0;
- 49 321 831 ÷ 2 = 24 660 915 + 1;
- 24 660 915 ÷ 2 = 12 330 457 + 1;
- 12 330 457 ÷ 2 = 6 165 228 + 1;
- 6 165 228 ÷ 2 = 3 082 614 + 0;
- 3 082 614 ÷ 2 = 1 541 307 + 0;
- 1 541 307 ÷ 2 = 770 653 + 1;
- 770 653 ÷ 2 = 385 326 + 1;
- 385 326 ÷ 2 = 192 663 + 0;
- 192 663 ÷ 2 = 96 331 + 1;
- 96 331 ÷ 2 = 48 165 + 1;
- 48 165 ÷ 2 = 24 082 + 1;
- 24 082 ÷ 2 = 12 041 + 0;
- 12 041 ÷ 2 = 6 020 + 1;
- 6 020 ÷ 2 = 3 010 + 0;
- 3 010 ÷ 2 = 1 505 + 0;
- 1 505 ÷ 2 = 752 + 1;
- 752 ÷ 2 = 376 + 0;
- 376 ÷ 2 = 188 + 0;
- 188 ÷ 2 = 94 + 0;
- 94 ÷ 2 = 47 + 0;
- 47 ÷ 2 = 23 + 1;
- 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.
101 011 110 005(10) = 1 0111 1000 0100 1011 1011 0011 1000 0111 0101(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) 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, 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:
Number 101 011 110 005(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
101 011 110 005(10) = 0000 0000 0000 0000 0000 0000 0001 0111 1000 0100 1011 1011 0011 1000 0111 0101
Spaces were used to group digits: for binary, by 4, for decimal, by 3.