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;
- 10 000 101 012 ÷ 2 = 5 000 050 506 + 0;
- 5 000 050 506 ÷ 2 = 2 500 025 253 + 0;
- 2 500 025 253 ÷ 2 = 1 250 012 626 + 1;
- 1 250 012 626 ÷ 2 = 625 006 313 + 0;
- 625 006 313 ÷ 2 = 312 503 156 + 1;
- 312 503 156 ÷ 2 = 156 251 578 + 0;
- 156 251 578 ÷ 2 = 78 125 789 + 0;
- 78 125 789 ÷ 2 = 39 062 894 + 1;
- 39 062 894 ÷ 2 = 19 531 447 + 0;
- 19 531 447 ÷ 2 = 9 765 723 + 1;
- 9 765 723 ÷ 2 = 4 882 861 + 1;
- 4 882 861 ÷ 2 = 2 441 430 + 1;
- 2 441 430 ÷ 2 = 1 220 715 + 0;
- 1 220 715 ÷ 2 = 610 357 + 1;
- 610 357 ÷ 2 = 305 178 + 1;
- 305 178 ÷ 2 = 152 589 + 0;
- 152 589 ÷ 2 = 76 294 + 1;
- 76 294 ÷ 2 = 38 147 + 0;
- 38 147 ÷ 2 = 19 073 + 1;
- 19 073 ÷ 2 = 9 536 + 1;
- 9 536 ÷ 2 = 4 768 + 0;
- 4 768 ÷ 2 = 2 384 + 0;
- 2 384 ÷ 2 = 1 192 + 0;
- 1 192 ÷ 2 = 596 + 0;
- 596 ÷ 2 = 298 + 0;
- 298 ÷ 2 = 149 + 0;
- 149 ÷ 2 = 74 + 1;
- 74 ÷ 2 = 37 + 0;
- 37 ÷ 2 = 18 + 1;
- 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.
10 000 101 012(10) = 10 0101 0100 0000 1101 0110 1110 1001 0100(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 34.
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) is reserved for 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, 34,
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:
Number 10 000 101 012(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
10 000 101 012(10) = 0000 0000 0000 0000 0000 0000 0000 0010 0101 0100 0000 1101 0110 1110 1001 0100
Spaces were used to group digits: for binary, by 4, for decimal, by 3.