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;
- 2 950 093 ÷ 2 = 1 475 046 + 1;
- 1 475 046 ÷ 2 = 737 523 + 0;
- 737 523 ÷ 2 = 368 761 + 1;
- 368 761 ÷ 2 = 184 380 + 1;
- 184 380 ÷ 2 = 92 190 + 0;
- 92 190 ÷ 2 = 46 095 + 0;
- 46 095 ÷ 2 = 23 047 + 1;
- 23 047 ÷ 2 = 11 523 + 1;
- 11 523 ÷ 2 = 5 761 + 1;
- 5 761 ÷ 2 = 2 880 + 1;
- 2 880 ÷ 2 = 1 440 + 0;
- 1 440 ÷ 2 = 720 + 0;
- 720 ÷ 2 = 360 + 0;
- 360 ÷ 2 = 180 + 0;
- 180 ÷ 2 = 90 + 0;
- 90 ÷ 2 = 45 + 0;
- 45 ÷ 2 = 22 + 1;
- 22 ÷ 2 = 11 + 0;
- 11 ÷ 2 = 5 + 1;
- 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.
2 950 093(10) = 10 1101 0000 0011 1100 1101(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 22.
- 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, 22,
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 2 950 093(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.