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;
- 7 260 700 ÷ 2 = 3 630 350 + 0;
- 3 630 350 ÷ 2 = 1 815 175 + 0;
- 1 815 175 ÷ 2 = 907 587 + 1;
- 907 587 ÷ 2 = 453 793 + 1;
- 453 793 ÷ 2 = 226 896 + 1;
- 226 896 ÷ 2 = 113 448 + 0;
- 113 448 ÷ 2 = 56 724 + 0;
- 56 724 ÷ 2 = 28 362 + 0;
- 28 362 ÷ 2 = 14 181 + 0;
- 14 181 ÷ 2 = 7 090 + 1;
- 7 090 ÷ 2 = 3 545 + 0;
- 3 545 ÷ 2 = 1 772 + 1;
- 1 772 ÷ 2 = 886 + 0;
- 886 ÷ 2 = 443 + 0;
- 443 ÷ 2 = 221 + 1;
- 221 ÷ 2 = 110 + 1;
- 110 ÷ 2 = 55 + 0;
- 55 ÷ 2 = 27 + 1;
- 27 ÷ 2 = 13 + 1;
- 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.
7 260 700(10) = 110 1110 1100 1010 0001 1100(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 23.
- 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, 23,
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.
Decimal Number 7 260 700(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.