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;
- 108 160 ÷ 2 = 54 080 + 0;
- 54 080 ÷ 2 = 27 040 + 0;
- 27 040 ÷ 2 = 13 520 + 0;
- 13 520 ÷ 2 = 6 760 + 0;
- 6 760 ÷ 2 = 3 380 + 0;
- 3 380 ÷ 2 = 1 690 + 0;
- 1 690 ÷ 2 = 845 + 0;
- 845 ÷ 2 = 422 + 1;
- 422 ÷ 2 = 211 + 0;
- 211 ÷ 2 = 105 + 1;
- 105 ÷ 2 = 52 + 1;
- 52 ÷ 2 = 26 + 0;
- 26 ÷ 2 = 13 + 0;
- 13 ÷ 2 = 6 + 1;
- 6 ÷ 2 = 3 + 0;
- 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.
108 160(10) = 1 1010 0110 1000 0000(2)
3. 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) 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, 17,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 32.
4. 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:
Number 108 160(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
108 160(10) = 0000 0000 0000 0001 1010 0110 1000 0000
Spaces were used to group digits: for binary, by 4, for decimal, by 3.