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;
- 3 054 810 271 ÷ 2 = 1 527 405 135 + 1;
- 1 527 405 135 ÷ 2 = 763 702 567 + 1;
- 763 702 567 ÷ 2 = 381 851 283 + 1;
- 381 851 283 ÷ 2 = 190 925 641 + 1;
- 190 925 641 ÷ 2 = 95 462 820 + 1;
- 95 462 820 ÷ 2 = 47 731 410 + 0;
- 47 731 410 ÷ 2 = 23 865 705 + 0;
- 23 865 705 ÷ 2 = 11 932 852 + 1;
- 11 932 852 ÷ 2 = 5 966 426 + 0;
- 5 966 426 ÷ 2 = 2 983 213 + 0;
- 2 983 213 ÷ 2 = 1 491 606 + 1;
- 1 491 606 ÷ 2 = 745 803 + 0;
- 745 803 ÷ 2 = 372 901 + 1;
- 372 901 ÷ 2 = 186 450 + 1;
- 186 450 ÷ 2 = 93 225 + 0;
- 93 225 ÷ 2 = 46 612 + 1;
- 46 612 ÷ 2 = 23 306 + 0;
- 23 306 ÷ 2 = 11 653 + 0;
- 11 653 ÷ 2 = 5 826 + 1;
- 5 826 ÷ 2 = 2 913 + 0;
- 2 913 ÷ 2 = 1 456 + 1;
- 1 456 ÷ 2 = 728 + 0;
- 728 ÷ 2 = 364 + 0;
- 364 ÷ 2 = 182 + 0;
- 182 ÷ 2 = 91 + 0;
- 91 ÷ 2 = 45 + 1;
- 45 ÷ 2 = 22 + 1;
- 22 ÷ 2 = 11 + 0;
- 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.
3 054 810 271(10) = 1011 0110 0001 0100 1011 0100 1001 1111(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 32.
- 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, 32,
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 3 054 810 271(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.