Two's Complement: Integer ↗ Binary: 219 902 444 463 114 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 219 902 444 463 114(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;
  • 219 902 444 463 114 ÷ 2 = 109 951 222 231 557 + 0;
  • 109 951 222 231 557 ÷ 2 = 54 975 611 115 778 + 1;
  • 54 975 611 115 778 ÷ 2 = 27 487 805 557 889 + 0;
  • 27 487 805 557 889 ÷ 2 = 13 743 902 778 944 + 1;
  • 13 743 902 778 944 ÷ 2 = 6 871 951 389 472 + 0;
  • 6 871 951 389 472 ÷ 2 = 3 435 975 694 736 + 0;
  • 3 435 975 694 736 ÷ 2 = 1 717 987 847 368 + 0;
  • 1 717 987 847 368 ÷ 2 = 858 993 923 684 + 0;
  • 858 993 923 684 ÷ 2 = 429 496 961 842 + 0;
  • 429 496 961 842 ÷ 2 = 214 748 480 921 + 0;
  • 214 748 480 921 ÷ 2 = 107 374 240 460 + 1;
  • 107 374 240 460 ÷ 2 = 53 687 120 230 + 0;
  • 53 687 120 230 ÷ 2 = 26 843 560 115 + 0;
  • 26 843 560 115 ÷ 2 = 13 421 780 057 + 1;
  • 13 421 780 057 ÷ 2 = 6 710 890 028 + 1;
  • 6 710 890 028 ÷ 2 = 3 355 445 014 + 0;
  • 3 355 445 014 ÷ 2 = 1 677 722 507 + 0;
  • 1 677 722 507 ÷ 2 = 838 861 253 + 1;
  • 838 861 253 ÷ 2 = 419 430 626 + 1;
  • 419 430 626 ÷ 2 = 209 715 313 + 0;
  • 209 715 313 ÷ 2 = 104 857 656 + 1;
  • 104 857 656 ÷ 2 = 52 428 828 + 0;
  • 52 428 828 ÷ 2 = 26 214 414 + 0;
  • 26 214 414 ÷ 2 = 13 107 207 + 0;
  • 13 107 207 ÷ 2 = 6 553 603 + 1;
  • 6 553 603 ÷ 2 = 3 276 801 + 1;
  • 3 276 801 ÷ 2 = 1 638 400 + 1;
  • 1 638 400 ÷ 2 = 819 200 + 0;
  • 819 200 ÷ 2 = 409 600 + 0;
  • 409 600 ÷ 2 = 204 800 + 0;
  • 204 800 ÷ 2 = 102 400 + 0;
  • 102 400 ÷ 2 = 51 200 + 0;
  • 51 200 ÷ 2 = 25 600 + 0;
  • 25 600 ÷ 2 = 12 800 + 0;
  • 12 800 ÷ 2 = 6 400 + 0;
  • 6 400 ÷ 2 = 3 200 + 0;
  • 3 200 ÷ 2 = 1 600 + 0;
  • 1 600 ÷ 2 = 800 + 0;
  • 800 ÷ 2 = 400 + 0;
  • 400 ÷ 2 = 200 + 0;
  • 200 ÷ 2 = 100 + 0;
  • 100 ÷ 2 = 50 + 0;
  • 50 ÷ 2 = 25 + 0;
  • 25 ÷ 2 = 12 + 1;
  • 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.


219 902 444 463 114(10) = 1100 1000 0000 0000 0000 0111 0001 0110 0110 0100 0000 1010(2)


3. Determine the signed binary number bit length:

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

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

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 219 902 444 463 114(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:

219 902 444 463 114(10) = 0000 0000 0000 0000 1100 1000 0000 0000 0000 0111 0001 0110 0110 0100 0000 1010

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 219 902 444 463 113 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 219 902 444 463 115 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 -9,251 from the decimal system (base 10) to a signed binary in two's complement representation Apr 16 18:07 UTC (GMT)
Convert and write the signed integer number -646,135,490 from the decimal system (base 10) to a signed binary in two's complement representation Apr 16 18:07 UTC (GMT)
Convert and write the signed integer number 32,769 from the decimal system (base 10) to a signed binary in two's complement representation Apr 16 18:06 UTC (GMT)
Convert and write the signed integer number 287 from the decimal system (base 10) to a signed binary in two's complement representation Apr 16 18:06 UTC (GMT)
Convert and write the signed integer number 15,569 from the decimal system (base 10) to a signed binary in two's complement representation Apr 16 18:06 UTC (GMT)
Convert and write the signed integer number 22,832 from the decimal system (base 10) to a signed binary in two's complement representation Apr 16 18:05 UTC (GMT)
Convert and write the signed integer number -101,593,690 from the decimal system (base 10) to a signed binary in two's complement representation Apr 16 18:05 UTC (GMT)
Convert and write the signed integer number 551 from the decimal system (base 10) to a signed binary in two's complement representation Apr 16 18:05 UTC (GMT)
Convert and write the signed integer number -93 from the decimal system (base 10) to a signed binary in two's complement representation Apr 16 18:04 UTC (GMT)
Convert and write the signed integer number 10,052 from the decimal system (base 10) to a signed binary in two's complement representation Apr 16 18:04 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