2. 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 718 017 213 ÷ 2 = 859 008 606 + 1;
- 859 008 606 ÷ 2 = 429 504 303 + 0;
- 429 504 303 ÷ 2 = 214 752 151 + 1;
- 214 752 151 ÷ 2 = 107 376 075 + 1;
- 107 376 075 ÷ 2 = 53 688 037 + 1;
- 53 688 037 ÷ 2 = 26 844 018 + 1;
- 26 844 018 ÷ 2 = 13 422 009 + 0;
- 13 422 009 ÷ 2 = 6 711 004 + 1;
- 6 711 004 ÷ 2 = 3 355 502 + 0;
- 3 355 502 ÷ 2 = 1 677 751 + 0;
- 1 677 751 ÷ 2 = 838 875 + 1;
- 838 875 ÷ 2 = 419 437 + 1;
- 419 437 ÷ 2 = 209 718 + 1;
- 209 718 ÷ 2 = 104 859 + 0;
- 104 859 ÷ 2 = 52 429 + 1;
- 52 429 ÷ 2 = 26 214 + 1;
- 26 214 ÷ 2 = 13 107 + 0;
- 13 107 ÷ 2 = 6 553 + 1;
- 6 553 ÷ 2 = 3 276 + 1;
- 3 276 ÷ 2 = 1 638 + 0;
- 1 638 ÷ 2 = 819 + 0;
- 819 ÷ 2 = 409 + 1;
- 409 ÷ 2 = 204 + 1;
- 204 ÷ 2 = 102 + 0;
- 102 ÷ 2 = 51 + 0;
- 51 ÷ 2 = 25 + 1;
- 25 ÷ 2 = 12 + 1;
- 12 ÷ 2 = 6 + 0;
- 6 ÷ 2 = 3 + 0;
- 3 ÷ 2 = 1 + 1;
- 1 ÷ 2 = 0 + 1;
3. Construct the base 2 representation of the positive number:
Take all the remainders starting from the bottom of the list constructed above.
1 718 017 213(10) = 110 0110 0110 0110 1101 1100 1011 1101(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 31.
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, 31,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 32.
5. Get the positive binary computer representation on 32 bits (4 Bytes):
If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 32:
1 718 017 213(10) = 0110 0110 0110 0110 1101 1100 1011 1101
6. Get the negative integer number representation:
To get the negative integer number representation on 32 bits (4 Bytes),
... change the first bit (the leftmost), from 0 to 1...
Number -1 718 017 213(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
-1 718 017 213(10) = 1110 0110 0110 0110 1101 1100 1011 1101
Spaces were used to group digits: for binary, by 4, for decimal, by 3.