1. Start with the positive version of the number:
|-68 079| = 68 079
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;
- 68 079 ÷ 2 = 34 039 + 1;
- 34 039 ÷ 2 = 17 019 + 1;
- 17 019 ÷ 2 = 8 509 + 1;
- 8 509 ÷ 2 = 4 254 + 1;
- 4 254 ÷ 2 = 2 127 + 0;
- 2 127 ÷ 2 = 1 063 + 1;
- 1 063 ÷ 2 = 531 + 1;
- 531 ÷ 2 = 265 + 1;
- 265 ÷ 2 = 132 + 1;
- 132 ÷ 2 = 66 + 0;
- 66 ÷ 2 = 33 + 0;
- 33 ÷ 2 = 16 + 1;
- 16 ÷ 2 = 8 + 0;
- 8 ÷ 2 = 4 + 0;
- 4 ÷ 2 = 2 + 0;
- 2 ÷ 2 = 1 + 0;
- 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.
68 079(10) = 1 0000 1001 1110 1111(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 17.
- 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, 17,
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.