# Base ten decimal system signed integer number -468 converted to signed binary in two's complement representation

## How to convert a signed integer in decimal system (in base 10): -468(10) to a signed binary two's complement representation

### 2. Divide the number repeatedly by 2, keeping track of each remainder, until we get a quotient that is equal to zero:

• division = quotient + remainder;
• 468 ÷ 2 = 234 + 0;
• 234 ÷ 2 = 117 + 0;
• 117 ÷ 2 = 58 + 1;
• 58 ÷ 2 = 29 + 0;
• 29 ÷ 2 = 14 + 1;
• 14 ÷ 2 = 7 + 0;
• 7 ÷ 2 = 3 + 1;
• 3 ÷ 2 = 1 + 1;
• 1 ÷ 2 = 0 + 1;

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

 -468 = 1111 1110 0010 1100 Jul 19 16:53 UTC (GMT) 9 = 0000 1001 Jul 19 16:53 UTC (GMT) -371 = 1111 1110 1000 1101 Jul 19 16:51 UTC (GMT) 103 = 0110 0111 Jul 19 16:51 UTC (GMT) 135 = 0000 0000 1000 0111 Jul 19 16:51 UTC (GMT) -13 = 1111 0011 Jul 19 16:50 UTC (GMT) -50 = 1100 1110 Jul 19 16:46 UTC (GMT) 110,111,000 = 0000 0110 1001 0000 0010 1001 0001 1000 Jul 19 16:46 UTC (GMT) 86 = 0101 0110 Jul 19 16:46 UTC (GMT) 67 = 0100 0011 Jul 19 16:45 UTC (GMT) -55 = 1100 1001 Jul 19 16:43 UTC (GMT) 540 = 0000 0010 0001 1100 Jul 19 16:38 UTC (GMT) 75 = 0100 1011 Jul 19 16:36 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