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;
- 5 632 348 ÷ 2 = 2 816 174 + 0;
- 2 816 174 ÷ 2 = 1 408 087 + 0;
- 1 408 087 ÷ 2 = 704 043 + 1;
- 704 043 ÷ 2 = 352 021 + 1;
- 352 021 ÷ 2 = 176 010 + 1;
- 176 010 ÷ 2 = 88 005 + 0;
- 88 005 ÷ 2 = 44 002 + 1;
- 44 002 ÷ 2 = 22 001 + 0;
- 22 001 ÷ 2 = 11 000 + 1;
- 11 000 ÷ 2 = 5 500 + 0;
- 5 500 ÷ 2 = 2 750 + 0;
- 2 750 ÷ 2 = 1 375 + 0;
- 1 375 ÷ 2 = 687 + 1;
- 687 ÷ 2 = 343 + 1;
- 343 ÷ 2 = 171 + 1;
- 171 ÷ 2 = 85 + 1;
- 85 ÷ 2 = 42 + 1;
- 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.
5 632 348(10) = 101 0101 1111 0001 0101 1100(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 23.
- 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, 23,
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 5 632 348(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.