One's Complement: Integer ↗ Binary: 1 010 109 994 Convert the Integer Number to a Signed Binary in One's Complement Representation. Write the Base Ten Decimal System Number as a Binary Code (Written in Base Two)

Signed integer number 1 010 109 994(10) converted and written as a signed binary in one'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 010 109 994 ÷ 2 = 505 054 997 + 0;
  • 505 054 997 ÷ 2 = 252 527 498 + 1;
  • 252 527 498 ÷ 2 = 126 263 749 + 0;
  • 126 263 749 ÷ 2 = 63 131 874 + 1;
  • 63 131 874 ÷ 2 = 31 565 937 + 0;
  • 31 565 937 ÷ 2 = 15 782 968 + 1;
  • 15 782 968 ÷ 2 = 7 891 484 + 0;
  • 7 891 484 ÷ 2 = 3 945 742 + 0;
  • 3 945 742 ÷ 2 = 1 972 871 + 0;
  • 1 972 871 ÷ 2 = 986 435 + 1;
  • 986 435 ÷ 2 = 493 217 + 1;
  • 493 217 ÷ 2 = 246 608 + 1;
  • 246 608 ÷ 2 = 123 304 + 0;
  • 123 304 ÷ 2 = 61 652 + 0;
  • 61 652 ÷ 2 = 30 826 + 0;
  • 30 826 ÷ 2 = 15 413 + 0;
  • 15 413 ÷ 2 = 7 706 + 1;
  • 7 706 ÷ 2 = 3 853 + 0;
  • 3 853 ÷ 2 = 1 926 + 1;
  • 1 926 ÷ 2 = 963 + 0;
  • 963 ÷ 2 = 481 + 1;
  • 481 ÷ 2 = 240 + 1;
  • 240 ÷ 2 = 120 + 0;
  • 120 ÷ 2 = 60 + 0;
  • 60 ÷ 2 = 30 + 0;
  • 30 ÷ 2 = 15 + 0;
  • 15 ÷ 2 = 7 + 1;
  • 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 010 109 994(10) = 11 1100 0011 0101 0000 1110 0010 1010(2)


3. Determine the signed binary number bit length:

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

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

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 010 109 994(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in one's complement representation:

1 010 109 994(10) = 0011 1100 0011 0101 0000 1110 0010 1010

Spaces were used to group digits: for binary, by 4, for decimal, by 3.

More operations on signed integers written as signed binary numbers in one's complement representation:

» Signed integer number 1 010 109 993 converted from decimal system (from base 10) and written as a signed binary in one's complement representation (written in base 2) = ?

» Signed integer number 1 010 109 995 converted from decimal system (from base 10) and written as a signed binary in one's complement representation (written in base 2) = ?

The latest signed integer numbers converted from decimal system (base ten) and written as signed binary in one's complement representation

Convert and write the decimal system (base 10) signed integer number 110,101,011,001,012 as a signed binary written in one's complement representation Apr 19 19:49 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 3,414,649,399 as a signed binary written in one's complement representation Apr 19 19:49 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 6,005,202,039,099,999,931 as a signed binary written in one's complement representation Apr 19 19:49 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -2,033,506,942 as a signed binary written in one's complement representation Apr 19 19:49 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -85,997 as a signed binary written in one's complement representation Apr 19 19:49 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 10,001,239 as a signed binary written in one's complement representation Apr 19 19:49 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -10,000,089 as a signed binary written in one's complement representation Apr 19 19:48 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 3,405,699,660 as a signed binary written in one's complement representation Apr 19 19:48 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 100,000,001,199 as a signed binary written in one's complement representation Apr 19 19:47 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 9,721,149,538 as a signed binary written in one's complement representation Apr 19 19:47 UTC (GMT)
All the decimal integer numbers converted and written as signed binary numbers in one's complement representation

How to convert signed integers from the decimal system to signed binary in one's complement representation

Follow the steps below to convert a signed base 10 integer number to signed binary in one'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 that is to be converted to binary, keeping track of each remainder, until we get a quotient that is equal to 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, fill in '0' bits in front (to the left) of the base 2 number calculated above, up to the right length; this way the first bit (leftmost) will always 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 '1's and all '1' bits with '0's.

Example: convert the negative number -49 from the decimal system (base ten) to signed binary one's complement:

  • 1. Start with the positive version of the number: |-49| = 49
  • 2. Divide repeatedly 49 by 2, keeping track of each remainder:
    • division = quotient + remainder
    • 49 ÷ 2 = 24 + 1
    • 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, by taking all the remainders starting from the bottom of the list constructed above:
    49(10) = 11 0001(2)
  • 4. The actual bit length of base 2 representation is 6, so the positive binary computer representation of a signed binary will take in this case 8 bits (the least power of 2 that is larger than 6) - add '0's in front of the base 2 number, up to the required length:
    49(10) = 0011 0001(2)
  • 5. To get the negative integer number representation in signed binary one's complement, replace all '0' bits with '1's and all '1' bits with '0's:
    -49(10) = 1100 1110
  • Number -49(10), signed integer, converted from the decimal system (base 10) to signed binary in one's complement representation = 1100 1110