# Convert -1 048 442 to signed binary, from a base 10 decimal system signed integer number

## -1 048 442(10) to a signed binary = ?

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

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

• division = quotient + remainder;
• 1 048 442 ÷ 2 = 524 221 + 0;
• 524 221 ÷ 2 = 262 110 + 1;
• 262 110 ÷ 2 = 131 055 + 0;
• 131 055 ÷ 2 = 65 527 + 1;
• 65 527 ÷ 2 = 32 763 + 1;
• 32 763 ÷ 2 = 16 381 + 1;
• 16 381 ÷ 2 = 8 190 + 1;
• 8 190 ÷ 2 = 4 095 + 0;
• 4 095 ÷ 2 = 2 047 + 1;
• 2 047 ÷ 2 = 1 023 + 1;
• 1 023 ÷ 2 = 511 + 1;
• 511 ÷ 2 = 255 + 1;
• 255 ÷ 2 = 127 + 1;
• 127 ÷ 2 = 63 + 1;
• 63 ÷ 2 = 31 + 1;
• 31 ÷ 2 = 15 + 1;
• 15 ÷ 2 = 7 + 1;
• 7 ÷ 2 = 3 + 1;
• 3 ÷ 2 = 1 + 1;
• 1 ÷ 2 = 0 + 1;

## Latest signed integer numbers in decimal (base ten) converted to signed binary

 -1,048,442 to signed binary = ? Nov 30 08:58 UTC (GMT) 26,803 to signed binary = ? Nov 30 08:58 UTC (GMT) 20,000,078 to signed binary = ? Nov 30 08:57 UTC (GMT) -220 to signed binary = ? Nov 30 08:57 UTC (GMT) 1,000,000,010,000,023 to signed binary = ? Nov 30 08:56 UTC (GMT) 301,016 to signed binary = ? Nov 30 08:55 UTC (GMT) 479,994 to signed binary = ? Nov 30 08:55 UTC (GMT) 49,408 to signed binary = ? Nov 30 08:54 UTC (GMT) 141,211,727 to signed binary = ? Nov 30 08:54 UTC (GMT) -703 to signed binary = ? Nov 30 08:53 UTC (GMT) -31,205 to signed binary = ? Nov 30 08:53 UTC (GMT) 26,508 to signed binary = ? Nov 30 08:53 UTC (GMT) -4,998 to signed binary = ? Nov 30 08:52 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