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;
- 25 602 300 050 966 ÷ 2 = 12 801 150 025 483 + 0;
- 12 801 150 025 483 ÷ 2 = 6 400 575 012 741 + 1;
- 6 400 575 012 741 ÷ 2 = 3 200 287 506 370 + 1;
- 3 200 287 506 370 ÷ 2 = 1 600 143 753 185 + 0;
- 1 600 143 753 185 ÷ 2 = 800 071 876 592 + 1;
- 800 071 876 592 ÷ 2 = 400 035 938 296 + 0;
- 400 035 938 296 ÷ 2 = 200 017 969 148 + 0;
- 200 017 969 148 ÷ 2 = 100 008 984 574 + 0;
- 100 008 984 574 ÷ 2 = 50 004 492 287 + 0;
- 50 004 492 287 ÷ 2 = 25 002 246 143 + 1;
- 25 002 246 143 ÷ 2 = 12 501 123 071 + 1;
- 12 501 123 071 ÷ 2 = 6 250 561 535 + 1;
- 6 250 561 535 ÷ 2 = 3 125 280 767 + 1;
- 3 125 280 767 ÷ 2 = 1 562 640 383 + 1;
- 1 562 640 383 ÷ 2 = 781 320 191 + 1;
- 781 320 191 ÷ 2 = 390 660 095 + 1;
- 390 660 095 ÷ 2 = 195 330 047 + 1;
- 195 330 047 ÷ 2 = 97 665 023 + 1;
- 97 665 023 ÷ 2 = 48 832 511 + 1;
- 48 832 511 ÷ 2 = 24 416 255 + 1;
- 24 416 255 ÷ 2 = 12 208 127 + 1;
- 12 208 127 ÷ 2 = 6 104 063 + 1;
- 6 104 063 ÷ 2 = 3 052 031 + 1;
- 3 052 031 ÷ 2 = 1 526 015 + 1;
- 1 526 015 ÷ 2 = 763 007 + 1;
- 763 007 ÷ 2 = 381 503 + 1;
- 381 503 ÷ 2 = 190 751 + 1;
- 190 751 ÷ 2 = 95 375 + 1;
- 95 375 ÷ 2 = 47 687 + 1;
- 47 687 ÷ 2 = 23 843 + 1;
- 23 843 ÷ 2 = 11 921 + 1;
- 11 921 ÷ 2 = 5 960 + 1;
- 5 960 ÷ 2 = 2 980 + 0;
- 2 980 ÷ 2 = 1 490 + 0;
- 1 490 ÷ 2 = 745 + 0;
- 745 ÷ 2 = 372 + 1;
- 372 ÷ 2 = 186 + 0;
- 186 ÷ 2 = 93 + 0;
- 93 ÷ 2 = 46 + 1;
- 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.
25 602 300 050 966(10) = 1 0111 0100 1000 1111 1111 1111 1111 1111 1110 0001 0110(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 45.
- 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, 45,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 64.
4. 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.
Decimal Number 25 602 300 050 966(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.