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;
- 604 569 427 ÷ 2 = 302 284 713 + 1;
- 302 284 713 ÷ 2 = 151 142 356 + 1;
- 151 142 356 ÷ 2 = 75 571 178 + 0;
- 75 571 178 ÷ 2 = 37 785 589 + 0;
- 37 785 589 ÷ 2 = 18 892 794 + 1;
- 18 892 794 ÷ 2 = 9 446 397 + 0;
- 9 446 397 ÷ 2 = 4 723 198 + 1;
- 4 723 198 ÷ 2 = 2 361 599 + 0;
- 2 361 599 ÷ 2 = 1 180 799 + 1;
- 1 180 799 ÷ 2 = 590 399 + 1;
- 590 399 ÷ 2 = 295 199 + 1;
- 295 199 ÷ 2 = 147 599 + 1;
- 147 599 ÷ 2 = 73 799 + 1;
- 73 799 ÷ 2 = 36 899 + 1;
- 36 899 ÷ 2 = 18 449 + 1;
- 18 449 ÷ 2 = 9 224 + 1;
- 9 224 ÷ 2 = 4 612 + 0;
- 4 612 ÷ 2 = 2 306 + 0;
- 2 306 ÷ 2 = 1 153 + 0;
- 1 153 ÷ 2 = 576 + 1;
- 576 ÷ 2 = 288 + 0;
- 288 ÷ 2 = 144 + 0;
- 144 ÷ 2 = 72 + 0;
- 72 ÷ 2 = 36 + 0;
- 36 ÷ 2 = 18 + 0;
- 18 ÷ 2 = 9 + 0;
- 9 ÷ 2 = 4 + 1;
- 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.
604 569 427(10) = 10 0100 0000 1000 1111 1111 0101 0011(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 604 569 427(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.