# Convert -1 601 011 011 to a signed binary in two's complement representation, from a signed integer number in base 10 decimal system

## How to convert a signed integer in decimal system (in base 10): -1 601 011 011(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;
• 1 601 011 011 ÷ 2 = 800 505 505 + 1;
• 800 505 505 ÷ 2 = 400 252 752 + 1;
• 400 252 752 ÷ 2 = 200 126 376 + 0;
• 200 126 376 ÷ 2 = 100 063 188 + 0;
• 100 063 188 ÷ 2 = 50 031 594 + 0;
• 50 031 594 ÷ 2 = 25 015 797 + 0;
• 25 015 797 ÷ 2 = 12 507 898 + 1;
• 12 507 898 ÷ 2 = 6 253 949 + 0;
• 6 253 949 ÷ 2 = 3 126 974 + 1;
• 3 126 974 ÷ 2 = 1 563 487 + 0;
• 1 563 487 ÷ 2 = 781 743 + 1;
• 781 743 ÷ 2 = 390 871 + 1;
• 390 871 ÷ 2 = 195 435 + 1;
• 195 435 ÷ 2 = 97 717 + 1;
• 97 717 ÷ 2 = 48 858 + 1;
• 48 858 ÷ 2 = 24 429 + 0;
• 24 429 ÷ 2 = 12 214 + 1;
• 12 214 ÷ 2 = 6 107 + 0;
• 6 107 ÷ 2 = 3 053 + 1;
• 3 053 ÷ 2 = 1 526 + 1;
• 1 526 ÷ 2 = 763 + 0;
• 763 ÷ 2 = 381 + 1;
• 381 ÷ 2 = 190 + 1;
• 190 ÷ 2 = 95 + 0;
• 95 ÷ 2 = 47 + 1;
• 47 ÷ 2 = 23 + 1;
• 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

 -1,601,011,011 to signed binary two's complement = ? Oct 30 04:01 UTC (GMT) -15 to signed binary two's complement = ? Oct 30 04:01 UTC (GMT) 199 to signed binary two's complement = ? Oct 30 04:00 UTC (GMT) 37,302 to signed binary two's complement = ? Oct 30 04:00 UTC (GMT) -803 to signed binary two's complement = ? Oct 30 03:59 UTC (GMT) -15 to signed binary two's complement = ? Oct 30 03:59 UTC (GMT) -15 to signed binary two's complement = ? Oct 30 03:58 UTC (GMT) 3,352,949,574 to signed binary two's complement = ? Oct 30 03:58 UTC (GMT) 69 to signed binary two's complement = ? Oct 30 03:57 UTC (GMT) -603 to signed binary two's complement = ? Oct 30 03:57 UTC (GMT) -32,662 to signed binary two's complement = ? Oct 30 03:57 UTC (GMT) 1,010,111 to signed binary two's complement = ? Oct 30 03:56 UTC (GMT) -75 to signed binary two's complement = ? Oct 30 03:55 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