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;
- 10 332 ÷ 2 = 5 166 + 0;
- 5 166 ÷ 2 = 2 583 + 0;
- 2 583 ÷ 2 = 1 291 + 1;
- 1 291 ÷ 2 = 645 + 1;
- 645 ÷ 2 = 322 + 1;
- 322 ÷ 2 = 161 + 0;
- 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;
2. Construct the base 2 representation of the positive number:
Take all the remainders starting from the bottom of the list constructed above.
10 332(10) = 10 1000 0101 1100(2)
3. 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) is reserved for 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.
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 10 332(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
10 332(10) = 0010 1000 0101 1100
Spaces were used to group digits: for binary, by 4, for decimal, by 3.