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;
- 11 099 915 ÷ 2 = 5 549 957 + 1;
- 5 549 957 ÷ 2 = 2 774 978 + 1;
- 2 774 978 ÷ 2 = 1 387 489 + 0;
- 1 387 489 ÷ 2 = 693 744 + 1;
- 693 744 ÷ 2 = 346 872 + 0;
- 346 872 ÷ 2 = 173 436 + 0;
- 173 436 ÷ 2 = 86 718 + 0;
- 86 718 ÷ 2 = 43 359 + 0;
- 43 359 ÷ 2 = 21 679 + 1;
- 21 679 ÷ 2 = 10 839 + 1;
- 10 839 ÷ 2 = 5 419 + 1;
- 5 419 ÷ 2 = 2 709 + 1;
- 2 709 ÷ 2 = 1 354 + 1;
- 1 354 ÷ 2 = 677 + 0;
- 677 ÷ 2 = 338 + 1;
- 338 ÷ 2 = 169 + 0;
- 169 ÷ 2 = 84 + 1;
- 84 ÷ 2 = 42 + 0;
- 42 ÷ 2 = 21 + 0;
- 21 ÷ 2 = 10 + 1;
- 10 ÷ 2 = 5 + 0;
- 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.
11 099 915(10) = 1010 1001 0101 1111 0000 1011(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 24.
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, 24,
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 11 099 915(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in two's complement representation:
11 099 915(10) = 0000 0000 1010 1001 0101 1111 0000 1011
Spaces were used to group digits: for binary, by 4, for decimal, by 3.