1. Start with the positive version of the number:
|-57 780| = 57 780
2. 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;
- 57 780 ÷ 2 = 28 890 + 0;
- 28 890 ÷ 2 = 14 445 + 0;
- 14 445 ÷ 2 = 7 222 + 1;
- 7 222 ÷ 2 = 3 611 + 0;
- 3 611 ÷ 2 = 1 805 + 1;
- 1 805 ÷ 2 = 902 + 1;
- 902 ÷ 2 = 451 + 0;
- 451 ÷ 2 = 225 + 1;
- 225 ÷ 2 = 112 + 1;
- 112 ÷ 2 = 56 + 0;
- 56 ÷ 2 = 28 + 0;
- 28 ÷ 2 = 14 + 0;
- 14 ÷ 2 = 7 + 0;
- 7 ÷ 2 = 3 + 1;
- 3 ÷ 2 = 1 + 1;
- 1 ÷ 2 = 0 + 1;
3. Construct the base 2 representation of the positive number:
Take all the remainders starting from the bottom of the list constructed above.
57 780(10) = 1110 0001 1011 0100(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 16.
- 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, 16,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 32.
5. 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.
Spaces were used to group digits: for binary, by 4, for decimal, by 3.