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

## How to convert the signed integer in decimal system (in base 10): 10 110 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;
• 10 110 110 ÷ 2 = 5 055 055 + 0;
• 5 055 055 ÷ 2 = 2 527 527 + 1;
• 2 527 527 ÷ 2 = 1 263 763 + 1;
• 1 263 763 ÷ 2 = 631 881 + 1;
• 631 881 ÷ 2 = 315 940 + 1;
• 315 940 ÷ 2 = 157 970 + 0;
• 157 970 ÷ 2 = 78 985 + 0;
• 78 985 ÷ 2 = 39 492 + 1;
• 39 492 ÷ 2 = 19 746 + 0;
• 19 746 ÷ 2 = 9 873 + 0;
• 9 873 ÷ 2 = 4 936 + 1;
• 4 936 ÷ 2 = 2 468 + 0;
• 2 468 ÷ 2 = 1 234 + 0;
• 1 234 ÷ 2 = 617 + 0;
• 617 ÷ 2 = 308 + 1;
• 308 ÷ 2 = 154 + 0;
• 154 ÷ 2 = 77 + 0;
• 77 ÷ 2 = 38 + 1;
• 38 ÷ 2 = 19 + 0;
• 19 ÷ 2 = 9 + 1;
• 9 ÷ 2 = 4 + 1;
• 4 ÷ 2 = 2 + 0;
• 2 ÷ 2 = 1 + 0;
• 1 ÷ 2 = 0 + 1;

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

 10,110,110 = 0000 0000 1001 1010 0100 0100 1001 1110 Dec 05 16:49 UTC (GMT) 6,660 = 0001 1010 0000 0100 Dec 05 16:49 UTC (GMT) 948 = 0000 0011 1011 0100 Dec 05 16:49 UTC (GMT) 921 = 0000 0011 1001 1001 Dec 05 16:49 UTC (GMT) 911 = 0000 0011 1000 1111 Dec 05 16:49 UTC (GMT) 898 = 0000 0011 1000 0010 Dec 05 16:49 UTC (GMT) 892 = 0000 0011 0111 1100 Dec 05 16:49 UTC (GMT) 877 = 0000 0011 0110 1101 Dec 05 16:49 UTC (GMT) 852 = 0000 0011 0101 0100 Dec 05 16:49 UTC (GMT) 841 = 0000 0011 0100 1001 Dec 05 16:49 UTC (GMT) 832 = 0000 0011 0100 0000 Dec 05 16:49 UTC (GMT) 175 = 0000 0000 1010 1111 Dec 05 16:49 UTC (GMT) 829 = 0000 0011 0011 1101 Dec 05 16:49 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