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;
- 828 169 ÷ 2 = 414 084 + 1;
- 414 084 ÷ 2 = 207 042 + 0;
- 207 042 ÷ 2 = 103 521 + 0;
- 103 521 ÷ 2 = 51 760 + 1;
- 51 760 ÷ 2 = 25 880 + 0;
- 25 880 ÷ 2 = 12 940 + 0;
- 12 940 ÷ 2 = 6 470 + 0;
- 6 470 ÷ 2 = 3 235 + 0;
- 3 235 ÷ 2 = 1 617 + 1;
- 1 617 ÷ 2 = 808 + 1;
- 808 ÷ 2 = 404 + 0;
- 404 ÷ 2 = 202 + 0;
- 202 ÷ 2 = 101 + 0;
- 101 ÷ 2 = 50 + 1;
- 50 ÷ 2 = 25 + 0;
- 25 ÷ 2 = 12 + 1;
- 12 ÷ 2 = 6 + 0;
- 6 ÷ 2 = 3 + 0;
- 3 ÷ 2 = 1 + 1;
- 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.
828 169(10) = 1100 1010 0011 0000 1001(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 828 169(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.