Two's Complement: Integer ↗ Binary: 1 904 803 927 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 904 803 927(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 904 803 927 ÷ 2 = 952 401 963 + 1;
  • 952 401 963 ÷ 2 = 476 200 981 + 1;
  • 476 200 981 ÷ 2 = 238 100 490 + 1;
  • 238 100 490 ÷ 2 = 119 050 245 + 0;
  • 119 050 245 ÷ 2 = 59 525 122 + 1;
  • 59 525 122 ÷ 2 = 29 762 561 + 0;
  • 29 762 561 ÷ 2 = 14 881 280 + 1;
  • 14 881 280 ÷ 2 = 7 440 640 + 0;
  • 7 440 640 ÷ 2 = 3 720 320 + 0;
  • 3 720 320 ÷ 2 = 1 860 160 + 0;
  • 1 860 160 ÷ 2 = 930 080 + 0;
  • 930 080 ÷ 2 = 465 040 + 0;
  • 465 040 ÷ 2 = 232 520 + 0;
  • 232 520 ÷ 2 = 116 260 + 0;
  • 116 260 ÷ 2 = 58 130 + 0;
  • 58 130 ÷ 2 = 29 065 + 0;
  • 29 065 ÷ 2 = 14 532 + 1;
  • 14 532 ÷ 2 = 7 266 + 0;
  • 7 266 ÷ 2 = 3 633 + 0;
  • 3 633 ÷ 2 = 1 816 + 1;
  • 1 816 ÷ 2 = 908 + 0;
  • 908 ÷ 2 = 454 + 0;
  • 454 ÷ 2 = 227 + 0;
  • 227 ÷ 2 = 113 + 1;
  • 113 ÷ 2 = 56 + 1;
  • 56 ÷ 2 = 28 + 0;
  • 28 ÷ 2 = 14 + 0;
  • 14 ÷ 2 = 7 + 0;
  • 7 ÷ 2 = 3 + 1;
  • 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 904 803 927(10) = 111 0001 1000 1001 0000 0000 0101 0111(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 904 803 927(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 904 803 927(10) = 0111 0001 1000 1001 0000 0000 0101 0111

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 904 803 926 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 904 803 928 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 10,111,111,111,100,156 from the decimal system (base 10) to a signed binary in two's complement representation May 01 13:41 UTC (GMT)
Convert and write the signed integer number -32,767 from the decimal system (base 10) to a signed binary in two's complement representation May 01 13:40 UTC (GMT)
Convert and write the signed integer number 182,144 from the decimal system (base 10) to a signed binary in two's complement representation May 01 13:40 UTC (GMT)
Convert and write the signed integer number 633,437,428 from the decimal system (base 10) to a signed binary in two's complement representation May 01 13:40 UTC (GMT)
Convert and write the signed integer number -1,342,177,308 from the decimal system (base 10) to a signed binary in two's complement representation May 01 13:40 UTC (GMT)
Convert and write the signed integer number 3,054,810,360 from the decimal system (base 10) to a signed binary in two's complement representation May 01 13:40 UTC (GMT)
Convert and write the signed integer number 1,001,101,015 from the decimal system (base 10) to a signed binary in two's complement representation May 01 13:40 UTC (GMT)
Convert and write the signed integer number 110,101,101 from the decimal system (base 10) to a signed binary in two's complement representation May 01 13:40 UTC (GMT)
Convert and write the signed integer number -78,062 from the decimal system (base 10) to a signed binary in two's complement representation May 01 13:40 UTC (GMT)
Convert and write the signed integer number 22,290 from the decimal system (base 10) to a signed binary in two's complement representation May 01 13:40 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