1. Start with the positive version of the number:
|-19 407 143 593| = 19 407 143 593
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;
- 19 407 143 593 ÷ 2 = 9 703 571 796 + 1;
- 9 703 571 796 ÷ 2 = 4 851 785 898 + 0;
- 4 851 785 898 ÷ 2 = 2 425 892 949 + 0;
- 2 425 892 949 ÷ 2 = 1 212 946 474 + 1;
- 1 212 946 474 ÷ 2 = 606 473 237 + 0;
- 606 473 237 ÷ 2 = 303 236 618 + 1;
- 303 236 618 ÷ 2 = 151 618 309 + 0;
- 151 618 309 ÷ 2 = 75 809 154 + 1;
- 75 809 154 ÷ 2 = 37 904 577 + 0;
- 37 904 577 ÷ 2 = 18 952 288 + 1;
- 18 952 288 ÷ 2 = 9 476 144 + 0;
- 9 476 144 ÷ 2 = 4 738 072 + 0;
- 4 738 072 ÷ 2 = 2 369 036 + 0;
- 2 369 036 ÷ 2 = 1 184 518 + 0;
- 1 184 518 ÷ 2 = 592 259 + 0;
- 592 259 ÷ 2 = 296 129 + 1;
- 296 129 ÷ 2 = 148 064 + 1;
- 148 064 ÷ 2 = 74 032 + 0;
- 74 032 ÷ 2 = 37 016 + 0;
- 37 016 ÷ 2 = 18 508 + 0;
- 18 508 ÷ 2 = 9 254 + 0;
- 9 254 ÷ 2 = 4 627 + 0;
- 4 627 ÷ 2 = 2 313 + 1;
- 2 313 ÷ 2 = 1 156 + 1;
- 1 156 ÷ 2 = 578 + 0;
- 578 ÷ 2 = 289 + 0;
- 289 ÷ 2 = 144 + 1;
- 144 ÷ 2 = 72 + 0;
- 72 ÷ 2 = 36 + 0;
- 36 ÷ 2 = 18 + 0;
- 18 ÷ 2 = 9 + 0;
- 9 ÷ 2 = 4 + 1;
- 4 ÷ 2 = 2 + 0;
- 2 ÷ 2 = 1 + 0;
- 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.
19 407 143 593(10) = 100 1000 0100 1100 0001 1000 0010 1010 1001(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 35.
- 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, 35,
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.