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;
- 40 199 194 ÷ 2 = 20 099 597 + 0;
- 20 099 597 ÷ 2 = 10 049 798 + 1;
- 10 049 798 ÷ 2 = 5 024 899 + 0;
- 5 024 899 ÷ 2 = 2 512 449 + 1;
- 2 512 449 ÷ 2 = 1 256 224 + 1;
- 1 256 224 ÷ 2 = 628 112 + 0;
- 628 112 ÷ 2 = 314 056 + 0;
- 314 056 ÷ 2 = 157 028 + 0;
- 157 028 ÷ 2 = 78 514 + 0;
- 78 514 ÷ 2 = 39 257 + 0;
- 39 257 ÷ 2 = 19 628 + 1;
- 19 628 ÷ 2 = 9 814 + 0;
- 9 814 ÷ 2 = 4 907 + 0;
- 4 907 ÷ 2 = 2 453 + 1;
- 2 453 ÷ 2 = 1 226 + 1;
- 1 226 ÷ 2 = 613 + 0;
- 613 ÷ 2 = 306 + 1;
- 306 ÷ 2 = 153 + 0;
- 153 ÷ 2 = 76 + 1;
- 76 ÷ 2 = 38 + 0;
- 38 ÷ 2 = 19 + 0;
- 19 ÷ 2 = 9 + 1;
- 9 ÷ 2 = 4 + 1;
- 4 ÷ 2 = 2 + 0;
- 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.
40 199 194(10) = 10 0110 0101 0110 0100 0001 1010(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 26.
- 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, 26,
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 40 199 194(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.