Convert -2 146 232 061 to signed binary, from a base 10 decimal system signed integer number

-2 146 232 061(10) to a signed binary = ?

1. Start with the positive version of the number:

|-2 146 232 061| = 2 146 232 061

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;
  • 2 146 232 061 ÷ 2 = 1 073 116 030 + 1;
  • 1 073 116 030 ÷ 2 = 536 558 015 + 0;
  • 536 558 015 ÷ 2 = 268 279 007 + 1;
  • 268 279 007 ÷ 2 = 134 139 503 + 1;
  • 134 139 503 ÷ 2 = 67 069 751 + 1;
  • 67 069 751 ÷ 2 = 33 534 875 + 1;
  • 33 534 875 ÷ 2 = 16 767 437 + 1;
  • 16 767 437 ÷ 2 = 8 383 718 + 1;
  • 8 383 718 ÷ 2 = 4 191 859 + 0;
  • 4 191 859 ÷ 2 = 2 095 929 + 1;
  • 2 095 929 ÷ 2 = 1 047 964 + 1;
  • 1 047 964 ÷ 2 = 523 982 + 0;
  • 523 982 ÷ 2 = 261 991 + 0;
  • 261 991 ÷ 2 = 130 995 + 1;
  • 130 995 ÷ 2 = 65 497 + 1;
  • 65 497 ÷ 2 = 32 748 + 1;
  • 32 748 ÷ 2 = 16 374 + 0;
  • 16 374 ÷ 2 = 8 187 + 0;
  • 8 187 ÷ 2 = 4 093 + 1;
  • 4 093 ÷ 2 = 2 046 + 1;
  • 2 046 ÷ 2 = 1 023 + 0;
  • 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;

3. Construct the base 2 representation of the positive number:

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

2 146 232 061(10) = 111 1111 1110 1100 1110 0110 1111 1101(2)


4. Determine the signed binary number bit length:

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

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, 31,


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:

2 146 232 061(10) = 0111 1111 1110 1100 1110 0110 1111 1101


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:


-2 146 232 061(10) =


1111 1111 1110 1100 1110 0110 1111 1101


Number -2 146 232 061, a signed integer, converted from decimal system (base 10) to signed binary:

-2 146 232 061(10) = 1111 1111 1110 1100 1110 0110 1111 1101

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:

-2 146 232 062 = ? | Signed integer -2 146 232 060 = ?


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

-2,146,232,061 to signed binary = ? Sep 20 03:02 UTC (GMT)
-114 to signed binary = ? Sep 20 03:02 UTC (GMT)
268,435,446 to signed binary = ? Sep 20 03:01 UTC (GMT)
23,301 to signed binary = ? Sep 20 03:00 UTC (GMT)
-10,526 to signed binary = ? Sep 20 02:59 UTC (GMT)
2,124,415,131,423,153 to signed binary = ? Sep 20 02:59 UTC (GMT)
1,485,799,046 to signed binary = ? Sep 20 02:58 UTC (GMT)
23,459 to signed binary = ? Sep 20 02:58 UTC (GMT)
1,111,000,010,100,001 to signed binary = ? Sep 20 02:57 UTC (GMT)
268 to signed binary = ? Sep 20 02:57 UTC (GMT)
2,934,587,365 to signed binary = ? Sep 20 02:57 UTC (GMT)
106,048,781,381,020 to signed binary = ? Sep 20 02:57 UTC (GMT)
177,651 to signed binary = ? Sep 20 02:56 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