# Convert -1 155 649 394 to signed binary, from a base 10 decimal system signed integer number

## -1 155 649 394(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 155 649 394 ÷ 2 = 577 824 697 + 0;
• 577 824 697 ÷ 2 = 288 912 348 + 1;
• 288 912 348 ÷ 2 = 144 456 174 + 0;
• 144 456 174 ÷ 2 = 72 228 087 + 0;
• 72 228 087 ÷ 2 = 36 114 043 + 1;
• 36 114 043 ÷ 2 = 18 057 021 + 1;
• 18 057 021 ÷ 2 = 9 028 510 + 1;
• 9 028 510 ÷ 2 = 4 514 255 + 0;
• 4 514 255 ÷ 2 = 2 257 127 + 1;
• 2 257 127 ÷ 2 = 1 128 563 + 1;
• 1 128 563 ÷ 2 = 564 281 + 1;
• 564 281 ÷ 2 = 282 140 + 1;
• 282 140 ÷ 2 = 141 070 + 0;
• 141 070 ÷ 2 = 70 535 + 0;
• 70 535 ÷ 2 = 35 267 + 1;
• 35 267 ÷ 2 = 17 633 + 1;
• 17 633 ÷ 2 = 8 816 + 1;
• 8 816 ÷ 2 = 4 408 + 0;
• 4 408 ÷ 2 = 2 204 + 0;
• 2 204 ÷ 2 = 1 102 + 0;
• 1 102 ÷ 2 = 551 + 0;
• 551 ÷ 2 = 275 + 1;
• 275 ÷ 2 = 137 + 1;
• 137 ÷ 2 = 68 + 1;
• 68 ÷ 2 = 34 + 0;
• 34 ÷ 2 = 17 + 0;
• 17 ÷ 2 = 8 + 1;
• 8 ÷ 2 = 4 + 0;
• 4 ÷ 2 = 2 + 0;
• 2 ÷ 2 = 1 + 0;
• 1 ÷ 2 = 0 + 1;

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

 -1,155,649,394 to signed binary = ? Jun 13 23:04 UTC (GMT) 15,147 to signed binary = ? Jun 13 23:04 UTC (GMT) -27,182,828,285 to signed binary = ? Jun 13 23:04 UTC (GMT) 12,704 to signed binary = ? Jun 13 23:03 UTC (GMT) 2,114 to signed binary = ? Jun 13 23:03 UTC (GMT) -1,515,870,829 to signed binary = ? Jun 13 23:03 UTC (GMT) 73,145 to signed binary = ? Jun 13 23:03 UTC (GMT) -2,095,129 to signed binary = ? Jun 13 23:03 UTC (GMT) -9,185,794,525,094,739,980 to signed binary = ? Jun 13 23:03 UTC (GMT) 234 to signed binary = ? Jun 13 23:03 UTC (GMT) 96 to signed binary = ? Jun 13 23:03 UTC (GMT) 36,281 to signed binary = ? Jun 13 23:03 UTC (GMT) 161,203 to signed binary = ? Jun 13 23:03 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