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;
- 1 011 110 824 ÷ 2 = 505 555 412 + 0;
- 505 555 412 ÷ 2 = 252 777 706 + 0;
- 252 777 706 ÷ 2 = 126 388 853 + 0;
- 126 388 853 ÷ 2 = 63 194 426 + 1;
- 63 194 426 ÷ 2 = 31 597 213 + 0;
- 31 597 213 ÷ 2 = 15 798 606 + 1;
- 15 798 606 ÷ 2 = 7 899 303 + 0;
- 7 899 303 ÷ 2 = 3 949 651 + 1;
- 3 949 651 ÷ 2 = 1 974 825 + 1;
- 1 974 825 ÷ 2 = 987 412 + 1;
- 987 412 ÷ 2 = 493 706 + 0;
- 493 706 ÷ 2 = 246 853 + 0;
- 246 853 ÷ 2 = 123 426 + 1;
- 123 426 ÷ 2 = 61 713 + 0;
- 61 713 ÷ 2 = 30 856 + 1;
- 30 856 ÷ 2 = 15 428 + 0;
- 15 428 ÷ 2 = 7 714 + 0;
- 7 714 ÷ 2 = 3 857 + 0;
- 3 857 ÷ 2 = 1 928 + 1;
- 1 928 ÷ 2 = 964 + 0;
- 964 ÷ 2 = 482 + 0;
- 482 ÷ 2 = 241 + 0;
- 241 ÷ 2 = 120 + 1;
- 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.
1 011 110 824(10) = 11 1100 0100 0100 0101 0011 1010 1000(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 30.
- 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, 30,
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 1 011 110 824(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.