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 010 110 995 ÷ 2 = 50 505 055 497 + 1;
- 50 505 055 497 ÷ 2 = 25 252 527 748 + 1;
- 25 252 527 748 ÷ 2 = 12 626 263 874 + 0;
- 12 626 263 874 ÷ 2 = 6 313 131 937 + 0;
- 6 313 131 937 ÷ 2 = 3 156 565 968 + 1;
- 3 156 565 968 ÷ 2 = 1 578 282 984 + 0;
- 1 578 282 984 ÷ 2 = 789 141 492 + 0;
- 789 141 492 ÷ 2 = 394 570 746 + 0;
- 394 570 746 ÷ 2 = 197 285 373 + 0;
- 197 285 373 ÷ 2 = 98 642 686 + 1;
- 98 642 686 ÷ 2 = 49 321 343 + 0;
- 49 321 343 ÷ 2 = 24 660 671 + 1;
- 24 660 671 ÷ 2 = 12 330 335 + 1;
- 12 330 335 ÷ 2 = 6 165 167 + 1;
- 6 165 167 ÷ 2 = 3 082 583 + 1;
- 3 082 583 ÷ 2 = 1 541 291 + 1;
- 1 541 291 ÷ 2 = 770 645 + 1;
- 770 645 ÷ 2 = 385 322 + 1;
- 385 322 ÷ 2 = 192 661 + 0;
- 192 661 ÷ 2 = 96 330 + 1;
- 96 330 ÷ 2 = 48 165 + 0;
- 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 010 110 995(10) = 1 0111 1000 0100 1010 1011 1111 1010 0001 0011(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.
Number 101 010 110 995(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in one's complement representation:
101 010 110 995(10) = 0000 0000 0000 0000 0000 0000 0001 0111 1000 0100 1010 1011 1111 1010 0001 0011
Spaces were used to group digits: for binary, by 4, for decimal, by 3.