# Base ten decimal system signed integer number 100 110 converted to signed binary

## How to convert the signed integer in decimal system (in base 10): 100 110(10) to a signed binary

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

• division = quotient + remainder;
• 100 110 ÷ 2 = 50 055 + 0;
• 50 055 ÷ 2 = 25 027 + 1;
• 25 027 ÷ 2 = 12 513 + 1;
• 12 513 ÷ 2 = 6 256 + 1;
• 6 256 ÷ 2 = 3 128 + 0;
• 3 128 ÷ 2 = 1 564 + 0;
• 1 564 ÷ 2 = 782 + 0;
• 782 ÷ 2 = 391 + 0;
• 391 ÷ 2 = 195 + 1;
• 195 ÷ 2 = 97 + 1;
• 97 ÷ 2 = 48 + 1;
• 48 ÷ 2 = 24 + 0;
• 24 ÷ 2 = 12 + 0;
• 12 ÷ 2 = 6 + 0;
• 6 ÷ 2 = 3 + 0;
• 3 ÷ 2 = 1 + 1;
• 1 ÷ 2 = 0 + 1;

## Latest signed integers numbers converted from decimal (base ten) to signed binary

 100,110 = 0000 0000 0000 0001 1000 0111 0000 1110 Oct 20 18:51 UTC (GMT) -7,678,710,519,452,155,665 = 1110 1010 1001 0000 0100 0010 1000 1000 1010 1101 0000 0000 0011 1111 0001 0001 Oct 20 18:46 UTC (GMT) 50,102,102 = 0000 0010 1111 1100 0111 1111 0101 0110 Oct 20 18:45 UTC (GMT) -2,501 = 1000 1001 1100 0101 Oct 20 18:44 UTC (GMT) -1 = 11 Oct 20 18:44 UTC (GMT) 32,516 = 0111 1111 0000 0100 Oct 20 18:44 UTC (GMT) 2,415 = 0000 1001 0110 1111 Oct 20 18:43 UTC (GMT) -109 = 1110 1101 Oct 20 18:42 UTC (GMT) -3 = 1011 Oct 20 18:42 UTC (GMT) 10,000,111 = 0000 0000 1001 1000 1001 0110 1110 1111 Oct 20 18:37 UTC (GMT) 689 = 0000 0010 1011 0001 Oct 20 18:34 UTC (GMT) -261 = 1000 0001 0000 0101 Oct 20 18:32 UTC (GMT) 100,100,110 = 0000 0101 1111 0111 0110 1000 0000 1110 Oct 20 18:32 UTC (GMT) All decimal positive integers converted to signed binary

## How to convert signed integers from decimal system to binary code system

### Follow the steps below to convert a signed base ten integer number to signed binary:

• 1. In a signed binary, first bit (the leftmost) is reserved for sign: 0 = positive integer number, 1 = positive integer number. If the number to be converted is negative, start with its positive version.
• 2. Divide repeatedly by 2 the positive integer number keeping track of each remainder. STOP when 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 have a length of 4, 8, 16, 32, 64, ... bits (power of 2) - if needed, fill in extra '0' bits in front of the base 2 number (to the left), up to the right length; this way the first bit (the leftmost one) is always '0', as for a positive representation.
• 5. To get the negative reprezentation of the number, simply switch the first bit (the leftmost one), from '0' to '1'.

### Example: convert the negative number -63 from decimal system (base ten) to signed binary code system:

• 1. Start with the positive version of the number: |-63| = 63;
• 2. Divide repeatedly 63 by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
• division = quotient + remainder
• 63 ÷ 2 = 31 + 1
• 31 ÷ 2 = 15 + 1
• 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:
63(10) = 11 1111(2)
• 4. The actual length of base 2 representation number is 6, so the positive binary computer representation length of the signed binary will take in this case 8 bits (the least power of 2 higher than 6) - add extra '0's in front (to the left), up to the required length; this way the first bit (the leftmost one) is to be '0', as for a positive number:
63(10) = 0011 1111(2)
• 5. To get the negative integer number representation simply change the first bit (the leftmost), from '0' to '1':
-63(10) = 1011 1111