1. Start with the positive version of the number:
|-52 000 000 318| = 52 000 000 318
2. 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;
- 52 000 000 318 ÷ 2 = 26 000 000 159 + 0;
- 26 000 000 159 ÷ 2 = 13 000 000 079 + 1;
- 13 000 000 079 ÷ 2 = 6 500 000 039 + 1;
- 6 500 000 039 ÷ 2 = 3 250 000 019 + 1;
- 3 250 000 019 ÷ 2 = 1 625 000 009 + 1;
- 1 625 000 009 ÷ 2 = 812 500 004 + 1;
- 812 500 004 ÷ 2 = 406 250 002 + 0;
- 406 250 002 ÷ 2 = 203 125 001 + 0;
- 203 125 001 ÷ 2 = 101 562 500 + 1;
- 101 562 500 ÷ 2 = 50 781 250 + 0;
- 50 781 250 ÷ 2 = 25 390 625 + 0;
- 25 390 625 ÷ 2 = 12 695 312 + 1;
- 12 695 312 ÷ 2 = 6 347 656 + 0;
- 6 347 656 ÷ 2 = 3 173 828 + 0;
- 3 173 828 ÷ 2 = 1 586 914 + 0;
- 1 586 914 ÷ 2 = 793 457 + 0;
- 793 457 ÷ 2 = 396 728 + 1;
- 396 728 ÷ 2 = 198 364 + 0;
- 198 364 ÷ 2 = 99 182 + 0;
- 99 182 ÷ 2 = 49 591 + 0;
- 49 591 ÷ 2 = 24 795 + 1;
- 24 795 ÷ 2 = 12 397 + 1;
- 12 397 ÷ 2 = 6 198 + 1;
- 6 198 ÷ 2 = 3 099 + 0;
- 3 099 ÷ 2 = 1 549 + 1;
- 1 549 ÷ 2 = 774 + 1;
- 774 ÷ 2 = 387 + 0;
- 387 ÷ 2 = 193 + 1;
- 193 ÷ 2 = 96 + 1;
- 96 ÷ 2 = 48 + 0;
- 48 ÷ 2 = 24 + 0;
- 24 ÷ 2 = 12 + 0;
- 12 ÷ 2 = 6 + 0;
- 6 ÷ 2 = 3 + 0;
- 3 ÷ 2 = 1 + 1;
- 1 ÷ 2 = 0 + 1;
3. Construct the base 2 representation of the positive number:
Take all the remainders starting from the bottom of the list constructed above.
52 000 000 318(10) = 1100 0001 1011 0111 0001 0000 1001 0011 1110(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 36.
- 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, 36,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 64.
5. Get the positive binary computer representation on 64 bits (8 Bytes):
If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 64.