Two's Complement: Integer ↗ Binary: 100 100 099 993 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 100 100 099 993(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;
  • 100 100 099 993 ÷ 2 = 50 050 049 996 + 1;
  • 50 050 049 996 ÷ 2 = 25 025 024 998 + 0;
  • 25 025 024 998 ÷ 2 = 12 512 512 499 + 0;
  • 12 512 512 499 ÷ 2 = 6 256 256 249 + 1;
  • 6 256 256 249 ÷ 2 = 3 128 128 124 + 1;
  • 3 128 128 124 ÷ 2 = 1 564 064 062 + 0;
  • 1 564 064 062 ÷ 2 = 782 032 031 + 0;
  • 782 032 031 ÷ 2 = 391 016 015 + 1;
  • 391 016 015 ÷ 2 = 195 508 007 + 1;
  • 195 508 007 ÷ 2 = 97 754 003 + 1;
  • 97 754 003 ÷ 2 = 48 877 001 + 1;
  • 48 877 001 ÷ 2 = 24 438 500 + 1;
  • 24 438 500 ÷ 2 = 12 219 250 + 0;
  • 12 219 250 ÷ 2 = 6 109 625 + 0;
  • 6 109 625 ÷ 2 = 3 054 812 + 1;
  • 3 054 812 ÷ 2 = 1 527 406 + 0;
  • 1 527 406 ÷ 2 = 763 703 + 0;
  • 763 703 ÷ 2 = 381 851 + 1;
  • 381 851 ÷ 2 = 190 925 + 1;
  • 190 925 ÷ 2 = 95 462 + 1;
  • 95 462 ÷ 2 = 47 731 + 0;
  • 47 731 ÷ 2 = 23 865 + 1;
  • 23 865 ÷ 2 = 11 932 + 1;
  • 11 932 ÷ 2 = 5 966 + 0;
  • 5 966 ÷ 2 = 2 983 + 0;
  • 2 983 ÷ 2 = 1 491 + 1;
  • 1 491 ÷ 2 = 745 + 1;
  • 745 ÷ 2 = 372 + 1;
  • 372 ÷ 2 = 186 + 0;
  • 186 ÷ 2 = 93 + 0;
  • 93 ÷ 2 = 46 + 1;
  • 46 ÷ 2 = 23 + 0;
  • 23 ÷ 2 = 11 + 1;
  • 11 ÷ 2 = 5 + 1;
  • 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.


100 100 099 993(10) = 1 0111 0100 1110 0110 1110 0100 1111 1001 1001(2)


3. Determine the signed binary number bit length:

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

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

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 100 100 099 993(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:

100 100 099 993(10) = 0000 0000 0000 0000 0000 0000 0001 0111 0100 1110 0110 1110 0100 1111 1001 1001

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 100 100 099 992 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 100 100 099 994 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 83,109 from the decimal system (base 10) to a signed binary in two's complement representation May 18 18:52 UTC (GMT)
Convert and write the signed integer number -21,706 from the decimal system (base 10) to a signed binary in two's complement representation May 18 18:52 UTC (GMT)
Convert and write the signed integer number 52,395 from the decimal system (base 10) to a signed binary in two's complement representation May 18 18:51 UTC (GMT)
Convert and write the signed integer number 37,590,447 from the decimal system (base 10) to a signed binary in two's complement representation May 18 18:50 UTC (GMT)
Convert and write the signed integer number 576,460,752,303,423,500 from the decimal system (base 10) to a signed binary in two's complement representation May 18 18:50 UTC (GMT)
Convert and write the signed integer number 155,647 from the decimal system (base 10) to a signed binary in two's complement representation May 18 18:50 UTC (GMT)
Convert and write the signed integer number 110,101,009,935 from the decimal system (base 10) to a signed binary in two's complement representation May 18 18:50 UTC (GMT)
Convert and write the signed integer number 17,035 from the decimal system (base 10) to a signed binary in two's complement representation May 18 18:50 UTC (GMT)
Convert and write the signed integer number 10,101,011,009,975 from the decimal system (base 10) to a signed binary in two's complement representation May 18 18:49 UTC (GMT)
Convert and write the signed integer number 999 from the decimal system (base 10) to a signed binary in two's complement representation May 18 18: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