1. Start with the positive version of the number:
|-2 147 483 501| = 2 147 483 501
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;
- 2 147 483 501 ÷ 2 = 1 073 741 750 + 1;
- 1 073 741 750 ÷ 2 = 536 870 875 + 0;
- 536 870 875 ÷ 2 = 268 435 437 + 1;
- 268 435 437 ÷ 2 = 134 217 718 + 1;
- 134 217 718 ÷ 2 = 67 108 859 + 0;
- 67 108 859 ÷ 2 = 33 554 429 + 1;
- 33 554 429 ÷ 2 = 16 777 214 + 1;
- 16 777 214 ÷ 2 = 8 388 607 + 0;
- 8 388 607 ÷ 2 = 4 194 303 + 1;
- 4 194 303 ÷ 2 = 2 097 151 + 1;
- 2 097 151 ÷ 2 = 1 048 575 + 1;
- 1 048 575 ÷ 2 = 524 287 + 1;
- 524 287 ÷ 2 = 262 143 + 1;
- 262 143 ÷ 2 = 131 071 + 1;
- 131 071 ÷ 2 = 65 535 + 1;
- 65 535 ÷ 2 = 32 767 + 1;
- 32 767 ÷ 2 = 16 383 + 1;
- 16 383 ÷ 2 = 8 191 + 1;
- 8 191 ÷ 2 = 4 095 + 1;
- 4 095 ÷ 2 = 2 047 + 1;
- 2 047 ÷ 2 = 1 023 + 1;
- 1 023 ÷ 2 = 511 + 1;
- 511 ÷ 2 = 255 + 1;
- 255 ÷ 2 = 127 + 1;
- 127 ÷ 2 = 63 + 1;
- 63 ÷ 2 = 31 + 1;
- 31 ÷ 2 = 15 + 1;
- 15 ÷ 2 = 7 + 1;
- 7 ÷ 2 = 3 + 1;
- 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.
2 147 483 501(10) = 111 1111 1111 1111 1111 1111 0110 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:
2 147 483 501(10) = 0111 1111 1111 1111 1111 1111 0110 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 -2 147 483 501(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
-2 147 483 501(10) = 1111 1111 1111 1111 1111 1111 0110 1101
Spaces were used to group digits: for binary, by 4, for decimal, by 3.