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 062 010 ÷ 2 = 531 005 + 0;
- 531 005 ÷ 2 = 265 502 + 1;
- 265 502 ÷ 2 = 132 751 + 0;
- 132 751 ÷ 2 = 66 375 + 1;
- 66 375 ÷ 2 = 33 187 + 1;
- 33 187 ÷ 2 = 16 593 + 1;
- 16 593 ÷ 2 = 8 296 + 1;
- 8 296 ÷ 2 = 4 148 + 0;
- 4 148 ÷ 2 = 2 074 + 0;
- 2 074 ÷ 2 = 1 037 + 0;
- 1 037 ÷ 2 = 518 + 1;
- 518 ÷ 2 = 259 + 0;
- 259 ÷ 2 = 129 + 1;
- 129 ÷ 2 = 64 + 1;
- 64 ÷ 2 = 32 + 0;
- 32 ÷ 2 = 16 + 0;
- 16 ÷ 2 = 8 + 0;
- 8 ÷ 2 = 4 + 0;
- 4 ÷ 2 = 2 + 0;
- 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.
1 062 010(10) = 1 0000 0011 0100 0111 1010(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 21.
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, 21,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 32.
4. 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:
Number 1 062 010(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
1 062 010(10) = 0000 0000 0001 0000 0011 0100 0111 1010
Spaces were used to group digits: for binary, by 4, for decimal, by 3.