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 048 372 ÷ 2 = 524 186 + 0;
- 524 186 ÷ 2 = 262 093 + 0;
- 262 093 ÷ 2 = 131 046 + 1;
- 131 046 ÷ 2 = 65 523 + 0;
- 65 523 ÷ 2 = 32 761 + 1;
- 32 761 ÷ 2 = 16 380 + 1;
- 16 380 ÷ 2 = 8 190 + 0;
- 8 190 ÷ 2 = 4 095 + 0;
- 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.
1 048 372(10) = 1111 1111 1111 0011 0100(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 20.
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, 20,
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 048 372(10) = 0000 0000 0000 1111 1111 1111 0011 0100
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 048 372(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
-1 048 372(10) = 1000 0000 0000 1111 1111 1111 0011 0100
Spaces were used to group digits: for binary, by 4, for decimal, by 3.