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;
- 166 283 ÷ 2 = 83 141 + 1;
- 83 141 ÷ 2 = 41 570 + 1;
- 41 570 ÷ 2 = 20 785 + 0;
- 20 785 ÷ 2 = 10 392 + 1;
- 10 392 ÷ 2 = 5 196 + 0;
- 5 196 ÷ 2 = 2 598 + 0;
- 2 598 ÷ 2 = 1 299 + 0;
- 1 299 ÷ 2 = 649 + 1;
- 649 ÷ 2 = 324 + 1;
- 324 ÷ 2 = 162 + 0;
- 162 ÷ 2 = 81 + 0;
- 81 ÷ 2 = 40 + 1;
- 40 ÷ 2 = 20 + 0;
- 20 ÷ 2 = 10 + 0;
- 10 ÷ 2 = 5 + 0;
- 5 ÷ 2 = 2 + 1;
- 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.
166 283(10) = 10 1000 1001 1000 1011(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 18.
- 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, 18,
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 166 283(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.