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;
- 577 613 ÷ 2 = 288 806 + 1;
- 288 806 ÷ 2 = 144 403 + 0;
- 144 403 ÷ 2 = 72 201 + 1;
- 72 201 ÷ 2 = 36 100 + 1;
- 36 100 ÷ 2 = 18 050 + 0;
- 18 050 ÷ 2 = 9 025 + 0;
- 9 025 ÷ 2 = 4 512 + 1;
- 4 512 ÷ 2 = 2 256 + 0;
- 2 256 ÷ 2 = 1 128 + 0;
- 1 128 ÷ 2 = 564 + 0;
- 564 ÷ 2 = 282 + 0;
- 282 ÷ 2 = 141 + 0;
- 141 ÷ 2 = 70 + 1;
- 70 ÷ 2 = 35 + 0;
- 35 ÷ 2 = 17 + 1;
- 17 ÷ 2 = 8 + 1;
- 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.
577 613(10) = 1000 1101 0000 0100 1101(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 577 613(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.