Two's Complement: Integer ↗ Binary: 478 868 574 082 066 864 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 478 868 574 082 066 864(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;
  • 478 868 574 082 066 864 ÷ 2 = 239 434 287 041 033 432 + 0;
  • 239 434 287 041 033 432 ÷ 2 = 119 717 143 520 516 716 + 0;
  • 119 717 143 520 516 716 ÷ 2 = 59 858 571 760 258 358 + 0;
  • 59 858 571 760 258 358 ÷ 2 = 29 929 285 880 129 179 + 0;
  • 29 929 285 880 129 179 ÷ 2 = 14 964 642 940 064 589 + 1;
  • 14 964 642 940 064 589 ÷ 2 = 7 482 321 470 032 294 + 1;
  • 7 482 321 470 032 294 ÷ 2 = 3 741 160 735 016 147 + 0;
  • 3 741 160 735 016 147 ÷ 2 = 1 870 580 367 508 073 + 1;
  • 1 870 580 367 508 073 ÷ 2 = 935 290 183 754 036 + 1;
  • 935 290 183 754 036 ÷ 2 = 467 645 091 877 018 + 0;
  • 467 645 091 877 018 ÷ 2 = 233 822 545 938 509 + 0;
  • 233 822 545 938 509 ÷ 2 = 116 911 272 969 254 + 1;
  • 116 911 272 969 254 ÷ 2 = 58 455 636 484 627 + 0;
  • 58 455 636 484 627 ÷ 2 = 29 227 818 242 313 + 1;
  • 29 227 818 242 313 ÷ 2 = 14 613 909 121 156 + 1;
  • 14 613 909 121 156 ÷ 2 = 7 306 954 560 578 + 0;
  • 7 306 954 560 578 ÷ 2 = 3 653 477 280 289 + 0;
  • 3 653 477 280 289 ÷ 2 = 1 826 738 640 144 + 1;
  • 1 826 738 640 144 ÷ 2 = 913 369 320 072 + 0;
  • 913 369 320 072 ÷ 2 = 456 684 660 036 + 0;
  • 456 684 660 036 ÷ 2 = 228 342 330 018 + 0;
  • 228 342 330 018 ÷ 2 = 114 171 165 009 + 0;
  • 114 171 165 009 ÷ 2 = 57 085 582 504 + 1;
  • 57 085 582 504 ÷ 2 = 28 542 791 252 + 0;
  • 28 542 791 252 ÷ 2 = 14 271 395 626 + 0;
  • 14 271 395 626 ÷ 2 = 7 135 697 813 + 0;
  • 7 135 697 813 ÷ 2 = 3 567 848 906 + 1;
  • 3 567 848 906 ÷ 2 = 1 783 924 453 + 0;
  • 1 783 924 453 ÷ 2 = 891 962 226 + 1;
  • 891 962 226 ÷ 2 = 445 981 113 + 0;
  • 445 981 113 ÷ 2 = 222 990 556 + 1;
  • 222 990 556 ÷ 2 = 111 495 278 + 0;
  • 111 495 278 ÷ 2 = 55 747 639 + 0;
  • 55 747 639 ÷ 2 = 27 873 819 + 1;
  • 27 873 819 ÷ 2 = 13 936 909 + 1;
  • 13 936 909 ÷ 2 = 6 968 454 + 1;
  • 6 968 454 ÷ 2 = 3 484 227 + 0;
  • 3 484 227 ÷ 2 = 1 742 113 + 1;
  • 1 742 113 ÷ 2 = 871 056 + 1;
  • 871 056 ÷ 2 = 435 528 + 0;
  • 435 528 ÷ 2 = 217 764 + 0;
  • 217 764 ÷ 2 = 108 882 + 0;
  • 108 882 ÷ 2 = 54 441 + 0;
  • 54 441 ÷ 2 = 27 220 + 1;
  • 27 220 ÷ 2 = 13 610 + 0;
  • 13 610 ÷ 2 = 6 805 + 0;
  • 6 805 ÷ 2 = 3 402 + 1;
  • 3 402 ÷ 2 = 1 701 + 0;
  • 1 701 ÷ 2 = 850 + 1;
  • 850 ÷ 2 = 425 + 0;
  • 425 ÷ 2 = 212 + 1;
  • 212 ÷ 2 = 106 + 0;
  • 106 ÷ 2 = 53 + 0;
  • 53 ÷ 2 = 26 + 1;
  • 26 ÷ 2 = 13 + 0;
  • 13 ÷ 2 = 6 + 1;
  • 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.


478 868 574 082 066 864(10) = 110 1010 0101 0100 1000 0110 1110 0101 0100 0100 0010 0110 1001 1011 0000(2)


3. Determine the signed binary number bit length:

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

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

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 478 868 574 082 066 864(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:

478 868 574 082 066 864(10) = 0000 0110 1010 0101 0100 1000 0110 1110 0101 0100 0100 0010 0110 1001 1011 0000

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 478 868 574 082 066 863 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 478 868 574 082 066 865 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 6,552,442,540 from the decimal system (base 10) to a signed binary in two's complement representation Apr 30 11:50 UTC (GMT)
Convert and write the signed integer number 3,199,918 from the decimal system (base 10) to a signed binary in two's complement representation Apr 30 11:50 UTC (GMT)
Convert and write the signed integer number 270,729,409 from the decimal system (base 10) to a signed binary in two's complement representation Apr 30 11:50 UTC (GMT)
Convert and write the signed integer number -6,234,362 from the decimal system (base 10) to a signed binary in two's complement representation Apr 30 11:50 UTC (GMT)
Convert and write the signed integer number -17,493 from the decimal system (base 10) to a signed binary in two's complement representation Apr 30 11:50 UTC (GMT)
Convert and write the signed integer number 998,021 from the decimal system (base 10) to a signed binary in two's complement representation Apr 30 11:49 UTC (GMT)
Convert and write the signed integer number 657,118 from the decimal system (base 10) to a signed binary in two's complement representation Apr 30 11:49 UTC (GMT)
Convert and write the signed integer number 39,775 from the decimal system (base 10) to a signed binary in two's complement representation Apr 30 11:49 UTC (GMT)
Convert and write the signed integer number 7,627 from the decimal system (base 10) to a signed binary in two's complement representation Apr 30 11:49 UTC (GMT)
Convert and write the signed integer number -4,611,686,018,427,387,902 from the decimal system (base 10) to a signed binary in two's complement representation Apr 30 11:48 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