1. Divide the number repeatedly by 2:
Keep track of each remainder.
Stop when you get a quotient that is equal to zero.
- division = quotient + remainder;
- 524 563 ÷ 2 = 262 281 + 1;
- 262 281 ÷ 2 = 131 140 + 1;
- 131 140 ÷ 2 = 65 570 + 0;
- 65 570 ÷ 2 = 32 785 + 0;
- 32 785 ÷ 2 = 16 392 + 1;
- 16 392 ÷ 2 = 8 196 + 0;
- 8 196 ÷ 2 = 4 098 + 0;
- 4 098 ÷ 2 = 2 049 + 0;
- 2 049 ÷ 2 = 1 024 + 1;
- 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.
524 563(10) = 1000 0000 0001 0001 0011(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 20.
- 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, 20,
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 524 563(10) converted to signed binary in one's complement representation: