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;
- 110 010 160 ÷ 2 = 55 005 080 + 0;
- 55 005 080 ÷ 2 = 27 502 540 + 0;
- 27 502 540 ÷ 2 = 13 751 270 + 0;
- 13 751 270 ÷ 2 = 6 875 635 + 0;
- 6 875 635 ÷ 2 = 3 437 817 + 1;
- 3 437 817 ÷ 2 = 1 718 908 + 1;
- 1 718 908 ÷ 2 = 859 454 + 0;
- 859 454 ÷ 2 = 429 727 + 0;
- 429 727 ÷ 2 = 214 863 + 1;
- 214 863 ÷ 2 = 107 431 + 1;
- 107 431 ÷ 2 = 53 715 + 1;
- 53 715 ÷ 2 = 26 857 + 1;
- 26 857 ÷ 2 = 13 428 + 1;
- 13 428 ÷ 2 = 6 714 + 0;
- 6 714 ÷ 2 = 3 357 + 0;
- 3 357 ÷ 2 = 1 678 + 1;
- 1 678 ÷ 2 = 839 + 0;
- 839 ÷ 2 = 419 + 1;
- 419 ÷ 2 = 209 + 1;
- 209 ÷ 2 = 104 + 1;
- 104 ÷ 2 = 52 + 0;
- 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.
110 010 160(10) = 110 1000 1110 1001 1111 0011 0000(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 27.
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, 27,
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 110 010 160(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in one's complement representation:
110 010 160(10) = 0000 0110 1000 1110 1001 1111 0011 0000
Spaces were used to group digits: for binary, by 4, for decimal, by 3.