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;
- 491 588 ÷ 2 = 245 794 + 0;
- 245 794 ÷ 2 = 122 897 + 0;
- 122 897 ÷ 2 = 61 448 + 1;
- 61 448 ÷ 2 = 30 724 + 0;
- 30 724 ÷ 2 = 15 362 + 0;
- 15 362 ÷ 2 = 7 681 + 0;
- 7 681 ÷ 2 = 3 840 + 1;
- 3 840 ÷ 2 = 1 920 + 0;
- 1 920 ÷ 2 = 960 + 0;
- 960 ÷ 2 = 480 + 0;
- 480 ÷ 2 = 240 + 0;
- 240 ÷ 2 = 120 + 0;
- 120 ÷ 2 = 60 + 0;
- 60 ÷ 2 = 30 + 0;
- 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.
491 588(10) = 111 1000 0000 0100 0100(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 19.
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, 19,
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 491 588(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in one's complement representation:
491 588(10) = 0000 0000 0000 0111 1000 0000 0100 0100
Spaces were used to group digits: for binary, by 4, for decimal, by 3.