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 100 011 060 ÷ 2 = 5 050 005 530 + 0;
- 5 050 005 530 ÷ 2 = 2 525 002 765 + 0;
- 2 525 002 765 ÷ 2 = 1 262 501 382 + 1;
- 1 262 501 382 ÷ 2 = 631 250 691 + 0;
- 631 250 691 ÷ 2 = 315 625 345 + 1;
- 315 625 345 ÷ 2 = 157 812 672 + 1;
- 157 812 672 ÷ 2 = 78 906 336 + 0;
- 78 906 336 ÷ 2 = 39 453 168 + 0;
- 39 453 168 ÷ 2 = 19 726 584 + 0;
- 19 726 584 ÷ 2 = 9 863 292 + 0;
- 9 863 292 ÷ 2 = 4 931 646 + 0;
- 4 931 646 ÷ 2 = 2 465 823 + 0;
- 2 465 823 ÷ 2 = 1 232 911 + 1;
- 1 232 911 ÷ 2 = 616 455 + 1;
- 616 455 ÷ 2 = 308 227 + 1;
- 308 227 ÷ 2 = 154 113 + 1;
- 154 113 ÷ 2 = 77 056 + 1;
- 77 056 ÷ 2 = 38 528 + 0;
- 38 528 ÷ 2 = 19 264 + 0;
- 19 264 ÷ 2 = 9 632 + 0;
- 9 632 ÷ 2 = 4 816 + 0;
- 4 816 ÷ 2 = 2 408 + 0;
- 2 408 ÷ 2 = 1 204 + 0;
- 1 204 ÷ 2 = 602 + 0;
- 602 ÷ 2 = 301 + 0;
- 301 ÷ 2 = 150 + 1;
- 150 ÷ 2 = 75 + 0;
- 75 ÷ 2 = 37 + 1;
- 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 100 011 060(10) = 10 0101 1010 0000 0001 1111 0000 0011 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) 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, 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.
Decimal Number 10 100 011 060(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.