Convert -1 062 731 247 to signed binary, from a base 10 decimal system signed integer number

How to convert the signed integer in decimal system (in base 10):
-1 062 731 247(10)
to a signed binary

1. Start with the positive version of the number:

|-1 062 731 247| = 1 062 731 247

2. Divide the number repeatedly by 2:

Keep track of each remainder.

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

  • division = quotient + remainder;
  • 1 062 731 247 ÷ 2 = 531 365 623 + 1;
  • 531 365 623 ÷ 2 = 265 682 811 + 1;
  • 265 682 811 ÷ 2 = 132 841 405 + 1;
  • 132 841 405 ÷ 2 = 66 420 702 + 1;
  • 66 420 702 ÷ 2 = 33 210 351 + 0;
  • 33 210 351 ÷ 2 = 16 605 175 + 1;
  • 16 605 175 ÷ 2 = 8 302 587 + 1;
  • 8 302 587 ÷ 2 = 4 151 293 + 1;
  • 4 151 293 ÷ 2 = 2 075 646 + 1;
  • 2 075 646 ÷ 2 = 1 037 823 + 0;
  • 1 037 823 ÷ 2 = 518 911 + 1;
  • 518 911 ÷ 2 = 259 455 + 1;
  • 259 455 ÷ 2 = 129 727 + 1;
  • 129 727 ÷ 2 = 64 863 + 1;
  • 64 863 ÷ 2 = 32 431 + 1;
  • 32 431 ÷ 2 = 16 215 + 1;
  • 16 215 ÷ 2 = 8 107 + 1;
  • 8 107 ÷ 2 = 4 053 + 1;
  • 4 053 ÷ 2 = 2 026 + 1;
  • 2 026 ÷ 2 = 1 013 + 0;
  • 1 013 ÷ 2 = 506 + 1;
  • 506 ÷ 2 = 253 + 0;
  • 253 ÷ 2 = 126 + 1;
  • 126 ÷ 2 = 63 + 0;
  • 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:

Take all the remainders starting from the bottom of the list constructed above.

1 062 731 247(10) = 11 1111 0101 0111 1111 1101 1110 1111(2)


4. Determine the signed binary number bit length:

The base 2 number's actual length, in bits: 30.

A signed binary's bit length must be equal to a power of 2, as of:
21 = 2; 22 = 4; 23 = 8; 24 = 16; 25 = 32; 26 = 64; ...

First bit (the leftmost) is reserved for the sign:
0 = positive integer number, 1 = negative integer number

The least number that is:

a power of 2

and is larger than the actual length, 30,

so that the first bit (leftmost) could be zero

(we deal with a positive number at this moment)

is: 32.


5. Positive binary computer representation on 32 bits (4 Bytes):

If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 32:

1 062 731 247(10) = 0011 1111 0101 0111 1111 1101 1110 1111


6. Get the negative integer number representation:

To get the negative integer number representation on 32 bits (4 Bytes),

change the first bit (the leftmost), from 0 to 1:


-1 062 731 247(10) =

1011 1111 0101 0111 1111 1101 1110 1111


Conclusion:

Number -1 062 731 247, a signed integer, converted from decimal system (base 10) to signed binary:

-1 062 731 247(10) = 1011 1111 0101 0111 1111 1101 1110 1111

First bit (the leftmost) is reserved for the sign:
0 = positive integer number, 1 = negative integer number

Spaces used to group digits: for binary, by 4; for decimal, by 3.

More operations of this kind:

-1 062 731 248 = ? | Signed integer -1 062 731 246 = ?


Convert signed integer numbers from the decimal system (base ten) to signed binary

How to convert a base 10 signed integer number to signed binary:

1) Divide the positive version of number repeatedly by 2, keeping track of each remainder, till getting a quotient that is 0.

2) Construct the base 2 representation by taking the previously calculated remainders starting from the last remainder up to the first one, in that order.

3) Construct the positive binary computer representation so that the first bit is 0.

4) Only if the initial number is negative, change the first bit (the leftmost), from 0 to 1. The leftmost bit is reserved for the sign, 1 = negative, 0 = positive.

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

-1,062,731,247 to signed binary = ? Jan 26 17:37 UTC (GMT)
4,738 to signed binary = ? Jan 26 17:36 UTC (GMT)
11,010,116 to signed binary = ? Jan 26 17:36 UTC (GMT)
16,348 to signed binary = ? Jan 26 17:36 UTC (GMT)
16 to signed binary = ? Jan 26 17:36 UTC (GMT)
-8,793,278,316,383,117,313 to signed binary = ? Jan 26 17:36 UTC (GMT)
16,451 to signed binary = ? Jan 26 17:35 UTC (GMT)
123 to signed binary = ? Jan 26 17:35 UTC (GMT)
8,600 to signed binary = ? Jan 26 17:35 UTC (GMT)
7,145,989 to signed binary = ? Jan 26 17:34 UTC (GMT)
6,504 to signed binary = ? Jan 26 17:34 UTC (GMT)
1,110,101,000,010,093 to signed binary = ? Jan 26 17:34 UTC (GMT)
93,297 to signed binary = ? Jan 26 17:34 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

  • Number -63(10), signed integer, converted from decimal system (base 10) to signed binary = 1011 1111