Two's Complement: Integer ↗ Binary: -6 403 928 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 -6 403 928(10) converted and written as a signed binary in two's complement representation (base 2) = ?

1. Start with the positive version of the number:

|-6 403 928| = 6 403 928

2. 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;
  • 6 403 928 ÷ 2 = 3 201 964 + 0;
  • 3 201 964 ÷ 2 = 1 600 982 + 0;
  • 1 600 982 ÷ 2 = 800 491 + 0;
  • 800 491 ÷ 2 = 400 245 + 1;
  • 400 245 ÷ 2 = 200 122 + 1;
  • 200 122 ÷ 2 = 100 061 + 0;
  • 100 061 ÷ 2 = 50 030 + 1;
  • 50 030 ÷ 2 = 25 015 + 0;
  • 25 015 ÷ 2 = 12 507 + 1;
  • 12 507 ÷ 2 = 6 253 + 1;
  • 6 253 ÷ 2 = 3 126 + 1;
  • 3 126 ÷ 2 = 1 563 + 0;
  • 1 563 ÷ 2 = 781 + 1;
  • 781 ÷ 2 = 390 + 1;
  • 390 ÷ 2 = 195 + 0;
  • 195 ÷ 2 = 97 + 1;
  • 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;

3. Construct the base 2 representation of the positive number:

Take all the remainders starting from the bottom of the list constructed above.


6 403 928(10) = 110 0001 1011 0111 0101 1000(2)


4. Determine the signed binary number bit length:

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

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

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

=== is: 32.


5. 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.


6 403 928(10) = 0000 0000 0110 0001 1011 0111 0101 1000


6. Get the negative integer number representation. Part 1:

To write the negative integer number on 32 bits (4 Bytes),

as a signed binary in one's complement representation,

... replace all the bits on 0 with 1s and all the bits set on 1 with 0s.


Reverse the digits, flip the digits:

Replace the bits set on 0 with 1s and the bits set on 1 with 0s.

!(0000 0000 0110 0001 1011 0111 0101 1000)

= 1111 1111 1001 1110 0100 1000 1010 0111


7. Get the negative integer number representation. Part 2:

To write the negative integer number on 32 bits (4 Bytes),

as a signed binary in two's complement representation,

add 1 to the number calculated above

1111 1111 1001 1110 0100 1000 1010 0111

(to the signed binary in one's complement representation)


Binary addition carries on a value of 2:

0 + 0 = 0

0 + 1 = 1

1 + 1 = 10

1 + 10 = 11

1 + 11 = 100


Add 1 to the number calculated above
(to the signed binary number in one's complement representation):

-6 403 928 =

1111 1111 1001 1110 0100 1000 1010 0111 + 1


Number -6 403 928(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:

-6 403 928(10) = 1111 1111 1001 1110 0100 1000 1010 1000

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 -6 403 929 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 -6 403 927 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 1,111,111,101,000,182 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 18:24 UTC (GMT)
Convert and write the signed integer number -18,735 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 18:24 UTC (GMT)
Convert and write the signed integer number 1,904,803,927 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 18:24 UTC (GMT)
Convert and write the signed integer number 110,100,010,115 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 18:23 UTC (GMT)
Convert and write the signed integer number -2,147,483,646 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 18:23 UTC (GMT)
Convert and write the signed integer number -72,057,594,037,927,836 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 18:23 UTC (GMT)
Convert and write the signed integer number 6,410,487 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 18:22 UTC (GMT)
Convert and write the signed integer number 101,100,010 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 18:22 UTC (GMT)
Convert and write the signed integer number 11,958,904 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 18:22 UTC (GMT)
Convert and write the signed integer number -75 from the decimal system (base 10) to a signed binary in two's complement representation Apr 18 18:22 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