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;
- 936 ÷ 2 = 468 + 0;
- 468 ÷ 2 = 234 + 0;
- 234 ÷ 2 = 117 + 0;
- 117 ÷ 2 = 58 + 1;
- 58 ÷ 2 = 29 + 0;
- 29 ÷ 2 = 14 + 1;
- 14 ÷ 2 = 7 + 0;
- 7 ÷ 2 = 3 + 1;
- 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.
936(10) = 11 1010 1000(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 10.
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, 10,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 16.
4. 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.
Number 936(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in two's complement representation:
936(10) = 0000 0011 1010 1000
Spaces were used to group digits: for binary, by 4, for decimal, by 3.