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;
- 1 011 011 100 880 ÷ 2 = 505 505 550 440 + 0;
- 505 505 550 440 ÷ 2 = 252 752 775 220 + 0;
- 252 752 775 220 ÷ 2 = 126 376 387 610 + 0;
- 126 376 387 610 ÷ 2 = 63 188 193 805 + 0;
- 63 188 193 805 ÷ 2 = 31 594 096 902 + 1;
- 31 594 096 902 ÷ 2 = 15 797 048 451 + 0;
- 15 797 048 451 ÷ 2 = 7 898 524 225 + 1;
- 7 898 524 225 ÷ 2 = 3 949 262 112 + 1;
- 3 949 262 112 ÷ 2 = 1 974 631 056 + 0;
- 1 974 631 056 ÷ 2 = 987 315 528 + 0;
- 987 315 528 ÷ 2 = 493 657 764 + 0;
- 493 657 764 ÷ 2 = 246 828 882 + 0;
- 246 828 882 ÷ 2 = 123 414 441 + 0;
- 123 414 441 ÷ 2 = 61 707 220 + 1;
- 61 707 220 ÷ 2 = 30 853 610 + 0;
- 30 853 610 ÷ 2 = 15 426 805 + 0;
- 15 426 805 ÷ 2 = 7 713 402 + 1;
- 7 713 402 ÷ 2 = 3 856 701 + 0;
- 3 856 701 ÷ 2 = 1 928 350 + 1;
- 1 928 350 ÷ 2 = 964 175 + 0;
- 964 175 ÷ 2 = 482 087 + 1;
- 482 087 ÷ 2 = 241 043 + 1;
- 241 043 ÷ 2 = 120 521 + 1;
- 120 521 ÷ 2 = 60 260 + 1;
- 60 260 ÷ 2 = 30 130 + 0;
- 30 130 ÷ 2 = 15 065 + 0;
- 15 065 ÷ 2 = 7 532 + 1;
- 7 532 ÷ 2 = 3 766 + 0;
- 3 766 ÷ 2 = 1 883 + 0;
- 1 883 ÷ 2 = 941 + 1;
- 941 ÷ 2 = 470 + 1;
- 470 ÷ 2 = 235 + 0;
- 235 ÷ 2 = 117 + 1;
- 117 ÷ 2 = 58 + 1;
- 58 ÷ 2 = 29 + 0;
- 29 ÷ 2 = 14 + 1;
- 14 ÷ 2 = 7 + 0;
- 7 ÷ 2 = 3 + 1;
- 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.
1 011 011 100 880(10) = 1110 1011 0110 0100 1111 0101 0010 0000 1101 0000(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 40.
- 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, 40,
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 1 011 011 100 880(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.