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;
- 8 888 838 ÷ 2 = 4 444 419 + 0;
- 4 444 419 ÷ 2 = 2 222 209 + 1;
- 2 222 209 ÷ 2 = 1 111 104 + 1;
- 1 111 104 ÷ 2 = 555 552 + 0;
- 555 552 ÷ 2 = 277 776 + 0;
- 277 776 ÷ 2 = 138 888 + 0;
- 138 888 ÷ 2 = 69 444 + 0;
- 69 444 ÷ 2 = 34 722 + 0;
- 34 722 ÷ 2 = 17 361 + 0;
- 17 361 ÷ 2 = 8 680 + 1;
- 8 680 ÷ 2 = 4 340 + 0;
- 4 340 ÷ 2 = 2 170 + 0;
- 2 170 ÷ 2 = 1 085 + 0;
- 1 085 ÷ 2 = 542 + 1;
- 542 ÷ 2 = 271 + 0;
- 271 ÷ 2 = 135 + 1;
- 135 ÷ 2 = 67 + 1;
- 67 ÷ 2 = 33 + 1;
- 33 ÷ 2 = 16 + 1;
- 16 ÷ 2 = 8 + 0;
- 8 ÷ 2 = 4 + 0;
- 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.
8 888 838(10) = 1000 0111 1010 0010 0000 0110(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 8 888 838(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:
8 888 838(10) = 0000 0000 1000 0111 1010 0010 0000 0110
Spaces were used to group digits: for binary, by 4, for decimal, by 3.