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;
- 111 110 110 029 ÷ 2 = 55 555 055 014 + 1;
- 55 555 055 014 ÷ 2 = 27 777 527 507 + 0;
- 27 777 527 507 ÷ 2 = 13 888 763 753 + 1;
- 13 888 763 753 ÷ 2 = 6 944 381 876 + 1;
- 6 944 381 876 ÷ 2 = 3 472 190 938 + 0;
- 3 472 190 938 ÷ 2 = 1 736 095 469 + 0;
- 1 736 095 469 ÷ 2 = 868 047 734 + 1;
- 868 047 734 ÷ 2 = 434 023 867 + 0;
- 434 023 867 ÷ 2 = 217 011 933 + 1;
- 217 011 933 ÷ 2 = 108 505 966 + 1;
- 108 505 966 ÷ 2 = 54 252 983 + 0;
- 54 252 983 ÷ 2 = 27 126 491 + 1;
- 27 126 491 ÷ 2 = 13 563 245 + 1;
- 13 563 245 ÷ 2 = 6 781 622 + 1;
- 6 781 622 ÷ 2 = 3 390 811 + 0;
- 3 390 811 ÷ 2 = 1 695 405 + 1;
- 1 695 405 ÷ 2 = 847 702 + 1;
- 847 702 ÷ 2 = 423 851 + 0;
- 423 851 ÷ 2 = 211 925 + 1;
- 211 925 ÷ 2 = 105 962 + 1;
- 105 962 ÷ 2 = 52 981 + 0;
- 52 981 ÷ 2 = 26 490 + 1;
- 26 490 ÷ 2 = 13 245 + 0;
- 13 245 ÷ 2 = 6 622 + 1;
- 6 622 ÷ 2 = 3 311 + 0;
- 3 311 ÷ 2 = 1 655 + 1;
- 1 655 ÷ 2 = 827 + 1;
- 827 ÷ 2 = 413 + 1;
- 413 ÷ 2 = 206 + 1;
- 206 ÷ 2 = 103 + 0;
- 103 ÷ 2 = 51 + 1;
- 51 ÷ 2 = 25 + 1;
- 25 ÷ 2 = 12 + 1;
- 12 ÷ 2 = 6 + 0;
- 6 ÷ 2 = 3 + 0;
- 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.
111 110 110 029(10) = 1 1001 1101 1110 1010 1101 1011 1011 0100 1101(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 37.
- 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, 37,
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 111 110 110 029(10) converted to signed binary in one's complement representation: