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 389 094 ÷ 2 = 4 194 547 + 0;
- 4 194 547 ÷ 2 = 2 097 273 + 1;
- 2 097 273 ÷ 2 = 1 048 636 + 1;
- 1 048 636 ÷ 2 = 524 318 + 0;
- 524 318 ÷ 2 = 262 159 + 0;
- 262 159 ÷ 2 = 131 079 + 1;
- 131 079 ÷ 2 = 65 539 + 1;
- 65 539 ÷ 2 = 32 769 + 1;
- 32 769 ÷ 2 = 16 384 + 1;
- 16 384 ÷ 2 = 8 192 + 0;
- 8 192 ÷ 2 = 4 096 + 0;
- 4 096 ÷ 2 = 2 048 + 0;
- 2 048 ÷ 2 = 1 024 + 0;
- 1 024 ÷ 2 = 512 + 0;
- 512 ÷ 2 = 256 + 0;
- 256 ÷ 2 = 128 + 0;
- 128 ÷ 2 = 64 + 0;
- 64 ÷ 2 = 32 + 0;
- 32 ÷ 2 = 16 + 0;
- 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 389 094(10) = 1000 0000 0000 0001 1110 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 389 094(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 389 094(10) = 0000 0000 1000 0000 0000 0001 1110 0110
Spaces were used to group digits: for binary, by 4, for decimal, by 3.