Convert 10 977 674 957 to a signed binary in two's complement representation, from a signed integer number in base 10 decimal system

10 977 674 957(10) to a signed binary two's complement representation = ?

1. 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;
  • 10 977 674 957 ÷ 2 = 5 488 837 478 + 1;
  • 5 488 837 478 ÷ 2 = 2 744 418 739 + 0;
  • 2 744 418 739 ÷ 2 = 1 372 209 369 + 1;
  • 1 372 209 369 ÷ 2 = 686 104 684 + 1;
  • 686 104 684 ÷ 2 = 343 052 342 + 0;
  • 343 052 342 ÷ 2 = 171 526 171 + 0;
  • 171 526 171 ÷ 2 = 85 763 085 + 1;
  • 85 763 085 ÷ 2 = 42 881 542 + 1;
  • 42 881 542 ÷ 2 = 21 440 771 + 0;
  • 21 440 771 ÷ 2 = 10 720 385 + 1;
  • 10 720 385 ÷ 2 = 5 360 192 + 1;
  • 5 360 192 ÷ 2 = 2 680 096 + 0;
  • 2 680 096 ÷ 2 = 1 340 048 + 0;
  • 1 340 048 ÷ 2 = 670 024 + 0;
  • 670 024 ÷ 2 = 335 012 + 0;
  • 335 012 ÷ 2 = 167 506 + 0;
  • 167 506 ÷ 2 = 83 753 + 0;
  • 83 753 ÷ 2 = 41 876 + 1;
  • 41 876 ÷ 2 = 20 938 + 0;
  • 20 938 ÷ 2 = 10 469 + 0;
  • 10 469 ÷ 2 = 5 234 + 1;
  • 5 234 ÷ 2 = 2 617 + 0;
  • 2 617 ÷ 2 = 1 308 + 1;
  • 1 308 ÷ 2 = 654 + 0;
  • 654 ÷ 2 = 327 + 0;
  • 327 ÷ 2 = 163 + 1;
  • 163 ÷ 2 = 81 + 1;
  • 81 ÷ 2 = 40 + 1;
  • 40 ÷ 2 = 20 + 0;
  • 20 ÷ 2 = 10 + 0;
  • 10 ÷ 2 = 5 + 0;
  • 5 ÷ 2 = 2 + 1;
  • 2 ÷ 2 = 1 + 0;
  • 1 ÷ 2 = 0 + 1;

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

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

10 977 674 957(10) = 10 1000 1110 0101 0010 0000 0110 1100 1101(2)


3. Determine the signed binary number bit length:

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

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) indicates the sign,
1 = negative, 0 = positive.

The least number that is:


a power of 2


and is larger than the actual length, 34,


so that the first bit (leftmost) could be zero


(we deal with a positive number at this moment)


is: 64.


4. Positive binary computer representation on 64 bits (8 Bytes):

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

10 977 674 957(10) = 0000 0000 0000 0000 0000 0000 0000 0010 1000 1110 0101 0010 0000 0110 1100 1101


Number 10 977 674 957, a signed integer, converted from decimal system (base 10) to a signed binary two's complement representation:

10 977 674 957(10) = 0000 0000 0000 0000 0000 0000 0000 0010 1000 1110 0101 0010 0000 0110 1100 1101

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


More operations of this kind:

10 977 674 956 = ? | 10 977 674 958 = ?


Convert signed integer numbers from the decimal system (base ten) to signed binary two's complement representation

How to convert a base 10 signed integer number to signed binary in two's complement representation:

1) Divide the positive version of number repeatedly by 2, keeping track of each remainder, till getting a quotient that is equal to 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, switch all the bits from 0 to 1 and from 1 to 0 (reversing the digits).

5) Only if the initial number is negative, add 1 to the number at the previous point.

Latest signed integers converted from decimal system to binary two's complement representation

10,977,674,957 to signed binary two's complement = ? Apr 14 10:00 UTC (GMT)
163,430,042 to signed binary two's complement = ? Apr 14 10:00 UTC (GMT)
-163,415,972 to signed binary two's complement = ? Apr 14 10:00 UTC (GMT)
-57 to signed binary two's complement = ? Apr 14 10:00 UTC (GMT)
-17 to signed binary two's complement = ? Apr 14 10:00 UTC (GMT)
-13 to signed binary two's complement = ? Apr 14 10:00 UTC (GMT)
-17 to signed binary two's complement = ? Apr 14 10:00 UTC (GMT)
110,111,098 to signed binary two's complement = ? Apr 14 09:59 UTC (GMT)
-65 to signed binary two's complement = ? Apr 14 09:59 UTC (GMT)
-274 to signed binary two's complement = ? Apr 14 09:59 UTC (GMT)
2,115 to signed binary two's complement = ? Apr 14 09:58 UTC (GMT)
-1,942,713,270,595,850,293 to signed binary two's complement = ? Apr 14 09:58 UTC (GMT)
1,181,736 to signed binary two's complement = ? Apr 14 09:57 UTC (GMT)
All decimal integer numbers converted to signed binary two's complement representation

How to convert signed integers from decimal system to signed binary in two's complement representation

Follow the steps below to convert a signed base 10 integer number to signed binary in two's complement representation:

  • 1. If the number to be converted is negative, start with the positive version of the number.
  • 2. Divide repeatedly by 2 the positive representation of the integer number, keeping track of each remainder, until 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 must have 4, 8, 16, 32, 64, ... bit length (a power of 2) - if needed, add extra bits on 0 in front (to the left) of the base 2 number above, up to the required length, so that the first bit (the leftmost) will be 0, correctly representing a positive number.
  • 5. To get the negative integer number representation in signed binary one's complement, replace all 0 bits with 1s and all 1 bits with 0s (reversing the digits).
  • 6. To get the negative integer number, in signed binary two's complement representation, add 1 to the number above.

Example: convert the negative number -60 from the decimal system (base ten) to signed binary in two's complement:

  • 1. Start with the positive version of the number: |-60| = 60
  • 2. Divide repeatedly 60 by 2, keeping track of each remainder:
    • division = quotient + remainder
    • 60 ÷ 2 = 30 + 0
    • 30 ÷ 2 = 15 + 0
    • 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:
    60(10) = 11 1100(2)
  • 4. Bit length of base 2 representation number is 6, so the positive binary computer representation of a signed binary will take in this particular case 8 bits (the least power of 2 larger than 6) - add extra 0 digits in front of the base 2 number, up to the required length:
    60(10) = 0011 1100(2)
  • 5. To get the negative integer number representation in signed binary one's complement, replace all the 0 bits with 1s and all 1 bits with 0s (reversing the digits):
    !(0011 1100) = 1100 0011
  • 6. To get the negative integer number, signed binary in two's complement representation, add 1 to the number above:
    -60(10) = 1100 0011 + 1 = 1100 0100
  • Number -60(10), signed integer, converted from decimal system (base 10) to signed binary two's complement representation = 1100 0100