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;
- 380 560 ÷ 2 = 190 280 + 0;
- 190 280 ÷ 2 = 95 140 + 0;
- 95 140 ÷ 2 = 47 570 + 0;
- 47 570 ÷ 2 = 23 785 + 0;
- 23 785 ÷ 2 = 11 892 + 1;
- 11 892 ÷ 2 = 5 946 + 0;
- 5 946 ÷ 2 = 2 973 + 0;
- 2 973 ÷ 2 = 1 486 + 1;
- 1 486 ÷ 2 = 743 + 0;
- 743 ÷ 2 = 371 + 1;
- 371 ÷ 2 = 185 + 1;
- 185 ÷ 2 = 92 + 1;
- 92 ÷ 2 = 46 + 0;
- 46 ÷ 2 = 23 + 0;
- 23 ÷ 2 = 11 + 1;
- 11 ÷ 2 = 5 + 1;
- 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.
380 560(10) = 101 1100 1110 1001 0000(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 380 560(10) converted to signed binary in one's complement representation: