1. Divide the number repeatedly by 2:
Keep track of each remainder.
Stop when you get a quotient that is equal to zero.
- division = quotient + remainder;
- 600 018 ÷ 2 = 300 009 + 0;
- 300 009 ÷ 2 = 150 004 + 1;
- 150 004 ÷ 2 = 75 002 + 0;
- 75 002 ÷ 2 = 37 501 + 0;
- 37 501 ÷ 2 = 18 750 + 1;
- 18 750 ÷ 2 = 9 375 + 0;
- 9 375 ÷ 2 = 4 687 + 1;
- 4 687 ÷ 2 = 2 343 + 1;
- 2 343 ÷ 2 = 1 171 + 1;
- 1 171 ÷ 2 = 585 + 1;
- 585 ÷ 2 = 292 + 1;
- 292 ÷ 2 = 146 + 0;
- 146 ÷ 2 = 73 + 0;
- 73 ÷ 2 = 36 + 1;
- 36 ÷ 2 = 18 + 0;
- 18 ÷ 2 = 9 + 0;
- 9 ÷ 2 = 4 + 1;
- 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.
600 018(10) = 1001 0010 0111 1101 0010(2)
3. 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) 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, 20,
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.
Decimal Number 600 018(10) converted to signed binary in one's complement representation: