Two's Complement: Integer ↗ Binary: 1 644 167 170 Convert the Integer Number to a Signed Binary in Two's Complement Representation. Write the Base Ten Decimal System Number as a Binary Code (Written in Base Two)

Signed integer number 1 644 167 170(10) converted and written as a signed binary in two's complement representation (base 2) = ?

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;
  • 1 644 167 170 ÷ 2 = 822 083 585 + 0;
  • 822 083 585 ÷ 2 = 411 041 792 + 1;
  • 411 041 792 ÷ 2 = 205 520 896 + 0;
  • 205 520 896 ÷ 2 = 102 760 448 + 0;
  • 102 760 448 ÷ 2 = 51 380 224 + 0;
  • 51 380 224 ÷ 2 = 25 690 112 + 0;
  • 25 690 112 ÷ 2 = 12 845 056 + 0;
  • 12 845 056 ÷ 2 = 6 422 528 + 0;
  • 6 422 528 ÷ 2 = 3 211 264 + 0;
  • 3 211 264 ÷ 2 = 1 605 632 + 0;
  • 1 605 632 ÷ 2 = 802 816 + 0;
  • 802 816 ÷ 2 = 401 408 + 0;
  • 401 408 ÷ 2 = 200 704 + 0;
  • 200 704 ÷ 2 = 100 352 + 0;
  • 100 352 ÷ 2 = 50 176 + 0;
  • 50 176 ÷ 2 = 25 088 + 0;
  • 25 088 ÷ 2 = 12 544 + 0;
  • 12 544 ÷ 2 = 6 272 + 0;
  • 6 272 ÷ 2 = 3 136 + 0;
  • 3 136 ÷ 2 = 1 568 + 0;
  • 1 568 ÷ 2 = 784 + 0;
  • 784 ÷ 2 = 392 + 0;
  • 392 ÷ 2 = 196 + 0;
  • 196 ÷ 2 = 98 + 0;
  • 98 ÷ 2 = 49 + 0;
  • 49 ÷ 2 = 24 + 1;
  • 24 ÷ 2 = 12 + 0;
  • 12 ÷ 2 = 6 + 0;
  • 6 ÷ 2 = 3 + 0;
  • 3 ÷ 2 = 1 + 1;
  • 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.


1 644 167 170(10) = 110 0010 0000 0000 0000 0000 0000 0010(2)


3. 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; ...

The first bit (the leftmost) indicates the sign:

0 = positive integer number, 1 = negative integer number


The least number that is:

1) a power of 2

2) and is larger than the actual length, 31,

3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)

=== is: 32.


4. Get the 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.


Number 1 644 167 170(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in two's complement representation:

1 644 167 170(10) = 0110 0010 0000 0000 0000 0000 0000 0010

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

More operations on integers written as signed binary numbers in two's complement representation:

» Signed integer number 1 644 167 169 converted from decimal system (from base 10) and written as a signed binary in two's complement representation (written in base 2) = ?

» Signed integer number 1 644 167 171 converted from decimal system (from base 10) and written as a signed binary in two's complement representation (written in base 2) = ?

The latest signed integer numbers written in base ten converted from decimal system to binary two's complement representation

Convert and write the signed integer number -11,011,046 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 19:51 UTC (GMT)
Convert and write the signed integer number -10,100,960 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 19:51 UTC (GMT)
Convert and write the signed integer number 4,228,744 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 19:50 UTC (GMT)
Convert and write the signed integer number 136,792 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 19:50 UTC (GMT)
Convert and write the signed integer number -12,674 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 19:50 UTC (GMT)
Convert and write the signed integer number -11,606 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 19:50 UTC (GMT)
Convert and write the signed integer number 524,267 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 19:50 UTC (GMT)
Convert and write the signed integer number 125,867 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 19:50 UTC (GMT)
Convert and write the signed integer number 23,073 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 19:50 UTC (GMT)
Convert and write the signed integer number 79,871 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 19:49 UTC (GMT)
All the decimal system integer numbers converted and written as signed binary numbers in 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