# Convert -99 999 999 989 to a signed binary in two's complement representation, from a signed integer number in base 10 decimal system

## -99 999 999 989(10) to a signed binary two's complement representation = ?

### 2. Divide the number repeatedly by 2:

#### We stop when we get a quotient that is equal to zero.

• division = quotient + remainder;
• 99 999 999 989 ÷ 2 = 49 999 999 994 + 1;
• 49 999 999 994 ÷ 2 = 24 999 999 997 + 0;
• 24 999 999 997 ÷ 2 = 12 499 999 998 + 1;
• 12 499 999 998 ÷ 2 = 6 249 999 999 + 0;
• 6 249 999 999 ÷ 2 = 3 124 999 999 + 1;
• 3 124 999 999 ÷ 2 = 1 562 499 999 + 1;
• 1 562 499 999 ÷ 2 = 781 249 999 + 1;
• 781 249 999 ÷ 2 = 390 624 999 + 1;
• 390 624 999 ÷ 2 = 195 312 499 + 1;
• 195 312 499 ÷ 2 = 97 656 249 + 1;
• 97 656 249 ÷ 2 = 48 828 124 + 1;
• 48 828 124 ÷ 2 = 24 414 062 + 0;
• 24 414 062 ÷ 2 = 12 207 031 + 0;
• 12 207 031 ÷ 2 = 6 103 515 + 1;
• 6 103 515 ÷ 2 = 3 051 757 + 1;
• 3 051 757 ÷ 2 = 1 525 878 + 1;
• 1 525 878 ÷ 2 = 762 939 + 0;
• 762 939 ÷ 2 = 381 469 + 1;
• 381 469 ÷ 2 = 190 734 + 1;
• 190 734 ÷ 2 = 95 367 + 0;
• 95 367 ÷ 2 = 47 683 + 1;
• 47 683 ÷ 2 = 23 841 + 1;
• 23 841 ÷ 2 = 11 920 + 1;
• 11 920 ÷ 2 = 5 960 + 0;
• 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;

## Latest signed integers converted from decimal system to binary two's complement representation

 -99,999,999,989 to signed binary two's complement = ? Apr 18 09:19 UTC (GMT) 7,177,689,270,052,918,062 to signed binary two's complement = ? Apr 18 09:19 UTC (GMT) -44 to signed binary two's complement = ? Apr 18 09:19 UTC (GMT) -1,015,496,772 to signed binary two's complement = ? Apr 18 09:19 UTC (GMT) 72 to signed binary two's complement = ? Apr 18 09:19 UTC (GMT) 10,100,072 to signed binary two's complement = ? Apr 18 09:19 UTC (GMT) -50,136,575 to signed binary two's complement = ? Apr 18 09:19 UTC (GMT) 10,604,858 to signed binary two's complement = ? Apr 18 09:19 UTC (GMT) 2,499,999,995 to signed binary two's complement = ? Apr 18 09:19 UTC (GMT) -5,120 to signed binary two's complement = ? Apr 18 09:18 UTC (GMT) -21,921 to signed binary two's complement = ? Apr 18 09:17 UTC (GMT) 12,346 to signed binary two's complement = ? Apr 18 09:17 UTC (GMT) -4,930 to signed binary two's complement = ? Apr 18 09:17 UTC (GMT) All decimal integer numbers converted to signed binary two's complement representation

## How to convert signed integers from decimal system to signed binary in two's complement representation

### Follow the steps below to convert a signed base 10 integer number to signed binary in two's complement representation:

• 1. If the number to be converted is negative, start with the positive version of the number.
• 2. Divide repeatedly by 2 the positive representation of the integer number, keeping track of each remainder, until we get a quotient that is zero.
• 3. Construct the base 2 representation of the positive number, by taking all the remainders starting from the bottom of the list constructed above. Thus, the last remainder of the divisions becomes the first symbol (the leftmost) of the base two number, while the first remainder becomes the last symbol (the rightmost).
• 4. Binary numbers represented in computer language must have 4, 8, 16, 32, 64, ... bit length (a power of 2) - if needed, add extra bits on 0 in front (to the left) of the base 2 number above, up to the required length, so that the first bit (the leftmost) will be 0, correctly representing a positive number.
• 5. To get the negative integer number representation in signed binary one's complement, replace all 0 bits with 1s and all 1 bits with 0s (reversing the digits).
• 6. To get the negative integer number, in signed binary two's complement representation, add 1 to the number above.

### Example: convert the negative number -60 from the decimal system (base ten) to signed binary in two's complement:

• 1. Start with the positive version of the number: |-60| = 60
• 2. Divide repeatedly 60 by 2, keeping track of each remainder:
• division = quotient + remainder
• 60 ÷ 2 = 30 + 0
• 30 ÷ 2 = 15 + 0
• 15 ÷ 2 = 7 + 1
• 7 ÷ 2 = 3 + 1
• 3 ÷ 2 = 1 + 1
• 1 ÷ 2 = 0 + 1
• 3. Construct the base 2 representation of the positive number, by taking all the remainders starting from the bottom of the list constructed above:
60(10) = 11 1100(2)
• 4. Bit length of base 2 representation number is 6, so the positive binary computer representation of a signed binary will take in this particular case 8 bits (the least power of 2 larger than 6) - add extra 0 digits in front of the base 2 number, up to the required length:
60(10) = 0011 1100(2)
• 5. To get the negative integer number representation in signed binary one's complement, replace all the 0 bits with 1s and all 1 bits with 0s (reversing the digits):
!(0011 1100) = 1100 0011
• 6. To get the negative integer number, signed binary in two's complement representation, add 1 to the number above:
-60(10) = 1100 0011 + 1 = 1100 0100