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;
- 360 403 ÷ 2 = 180 201 + 1;
- 180 201 ÷ 2 = 90 100 + 1;
- 90 100 ÷ 2 = 45 050 + 0;
- 45 050 ÷ 2 = 22 525 + 0;
- 22 525 ÷ 2 = 11 262 + 1;
- 11 262 ÷ 2 = 5 631 + 0;
- 5 631 ÷ 2 = 2 815 + 1;
- 2 815 ÷ 2 = 1 407 + 1;
- 1 407 ÷ 2 = 703 + 1;
- 703 ÷ 2 = 351 + 1;
- 351 ÷ 2 = 175 + 1;
- 175 ÷ 2 = 87 + 1;
- 87 ÷ 2 = 43 + 1;
- 43 ÷ 2 = 21 + 1;
- 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.
360 403(10) = 101 0111 1111 1101 0011(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.
Decimal Number 360 403(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.