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;
- 62 909 ÷ 2 = 31 454 + 1;
- 31 454 ÷ 2 = 15 727 + 0;
- 15 727 ÷ 2 = 7 863 + 1;
- 7 863 ÷ 2 = 3 931 + 1;
- 3 931 ÷ 2 = 1 965 + 1;
- 1 965 ÷ 2 = 982 + 1;
- 982 ÷ 2 = 491 + 0;
- 491 ÷ 2 = 245 + 1;
- 245 ÷ 2 = 122 + 1;
- 122 ÷ 2 = 61 + 0;
- 61 ÷ 2 = 30 + 1;
- 30 ÷ 2 = 15 + 0;
- 15 ÷ 2 = 7 + 1;
- 7 ÷ 2 = 3 + 1;
- 3 ÷ 2 = 1 + 1;
- 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.
62 909(10) = 1111 0101 1011 1101(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 16.
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, 16,
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 62 909(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:
62 909(10) = 0000 0000 0000 0000 1111 0101 1011 1101
Spaces were used to group digits: for binary, by 4, for decimal, by 3.