Two's Complement: Integer ↗ Binary: 3 270 918 085 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 3 270 918 085(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;
  • 3 270 918 085 ÷ 2 = 1 635 459 042 + 1;
  • 1 635 459 042 ÷ 2 = 817 729 521 + 0;
  • 817 729 521 ÷ 2 = 408 864 760 + 1;
  • 408 864 760 ÷ 2 = 204 432 380 + 0;
  • 204 432 380 ÷ 2 = 102 216 190 + 0;
  • 102 216 190 ÷ 2 = 51 108 095 + 0;
  • 51 108 095 ÷ 2 = 25 554 047 + 1;
  • 25 554 047 ÷ 2 = 12 777 023 + 1;
  • 12 777 023 ÷ 2 = 6 388 511 + 1;
  • 6 388 511 ÷ 2 = 3 194 255 + 1;
  • 3 194 255 ÷ 2 = 1 597 127 + 1;
  • 1 597 127 ÷ 2 = 798 563 + 1;
  • 798 563 ÷ 2 = 399 281 + 1;
  • 399 281 ÷ 2 = 199 640 + 1;
  • 199 640 ÷ 2 = 99 820 + 0;
  • 99 820 ÷ 2 = 49 910 + 0;
  • 49 910 ÷ 2 = 24 955 + 0;
  • 24 955 ÷ 2 = 12 477 + 1;
  • 12 477 ÷ 2 = 6 238 + 1;
  • 6 238 ÷ 2 = 3 119 + 0;
  • 3 119 ÷ 2 = 1 559 + 1;
  • 1 559 ÷ 2 = 779 + 1;
  • 779 ÷ 2 = 389 + 1;
  • 389 ÷ 2 = 194 + 1;
  • 194 ÷ 2 = 97 + 0;
  • 97 ÷ 2 = 48 + 1;
  • 48 ÷ 2 = 24 + 0;
  • 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.


3 270 918 085(10) = 1100 0010 1111 0110 0011 1111 1100 0101(2)


3. Determine the signed binary number bit length:

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

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

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

=== is: 64.


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


Number 3 270 918 085(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:

3 270 918 085(10) = 0000 0000 0000 0000 0000 0000 0000 0000 1100 0010 1111 0110 0011 1111 1100 0101

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 3 270 918 084 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 3 270 918 086 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 -126 from the decimal system (base 10) to a signed binary in two's complement representation May 17 08:14 UTC (GMT)
Convert and write the signed integer number 13,051,933 from the decimal system (base 10) to a signed binary in two's complement representation May 17 08:13 UTC (GMT)
Convert and write the signed integer number 286,779,852 from the decimal system (base 10) to a signed binary in two's complement representation May 17 08:13 UTC (GMT)
Convert and write the signed integer number -80 from the decimal system (base 10) to a signed binary in two's complement representation May 17 08:13 UTC (GMT)
Convert and write the signed integer number -781,580 from the decimal system (base 10) to a signed binary in two's complement representation May 17 08:13 UTC (GMT)
Convert and write the signed integer number -2,903,078 from the decimal system (base 10) to a signed binary in two's complement representation May 17 08:12 UTC (GMT)
Convert and write the signed integer number -25,786 from the decimal system (base 10) to a signed binary in two's complement representation May 17 08:12 UTC (GMT)
Convert and write the signed integer number -619,735,216 from the decimal system (base 10) to a signed binary in two's complement representation May 17 08:12 UTC (GMT)
Convert and write the signed integer number 12,859 from the decimal system (base 10) to a signed binary in two's complement representation May 17 08:11 UTC (GMT)
Convert and write the signed integer number 11,001,100,109,979 from the decimal system (base 10) to a signed binary in two's complement representation May 17 08:11 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