1. Start with the positive version of the number:
|-10 360| = 10 360
2. Divide the number repeatedly by 2:
Keep track of each remainder.
Stop when you get a quotient that is equal to zero.
- division = quotient + remainder;
- 10 360 ÷ 2 = 5 180 + 0;
- 5 180 ÷ 2 = 2 590 + 0;
- 2 590 ÷ 2 = 1 295 + 0;
- 1 295 ÷ 2 = 647 + 1;
- 647 ÷ 2 = 323 + 1;
- 323 ÷ 2 = 161 + 1;
- 161 ÷ 2 = 80 + 1;
- 80 ÷ 2 = 40 + 0;
- 40 ÷ 2 = 20 + 0;
- 20 ÷ 2 = 10 + 0;
- 10 ÷ 2 = 5 + 0;
- 5 ÷ 2 = 2 + 1;
- 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.
10 360(10) = 10 1000 0111 1000(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 14.
- 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, 14,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 16.
5. Get the positive binary computer representation on 16 bits (2 Bytes):
If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 16.