One's Complement: Integer ↗ Binary: 11 011 010 067 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 11 011 010 067(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;
  • 11 011 010 067 ÷ 2 = 5 505 505 033 + 1;
  • 5 505 505 033 ÷ 2 = 2 752 752 516 + 1;
  • 2 752 752 516 ÷ 2 = 1 376 376 258 + 0;
  • 1 376 376 258 ÷ 2 = 688 188 129 + 0;
  • 688 188 129 ÷ 2 = 344 094 064 + 1;
  • 344 094 064 ÷ 2 = 172 047 032 + 0;
  • 172 047 032 ÷ 2 = 86 023 516 + 0;
  • 86 023 516 ÷ 2 = 43 011 758 + 0;
  • 43 011 758 ÷ 2 = 21 505 879 + 0;
  • 21 505 879 ÷ 2 = 10 752 939 + 1;
  • 10 752 939 ÷ 2 = 5 376 469 + 1;
  • 5 376 469 ÷ 2 = 2 688 234 + 1;
  • 2 688 234 ÷ 2 = 1 344 117 + 0;
  • 1 344 117 ÷ 2 = 672 058 + 1;
  • 672 058 ÷ 2 = 336 029 + 0;
  • 336 029 ÷ 2 = 168 014 + 1;
  • 168 014 ÷ 2 = 84 007 + 0;
  • 84 007 ÷ 2 = 42 003 + 1;
  • 42 003 ÷ 2 = 21 001 + 1;
  • 21 001 ÷ 2 = 10 500 + 1;
  • 10 500 ÷ 2 = 5 250 + 0;
  • 5 250 ÷ 2 = 2 625 + 0;
  • 2 625 ÷ 2 = 1 312 + 1;
  • 1 312 ÷ 2 = 656 + 0;
  • 656 ÷ 2 = 328 + 0;
  • 328 ÷ 2 = 164 + 0;
  • 164 ÷ 2 = 82 + 0;
  • 82 ÷ 2 = 41 + 0;
  • 41 ÷ 2 = 20 + 1;
  • 20 ÷ 2 = 10 + 0;
  • 10 ÷ 2 = 5 + 0;
  • 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.


11 011 010 067(10) = 10 1001 0000 0100 1110 1010 1110 0001 0011(2)


3. Determine the signed binary number bit length:

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

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

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 11 011 010 067(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:

11 011 010 067(10) = 0000 0000 0000 0000 0000 0000 0000 0010 1001 0000 0100 1110 1010 1110 0001 0011

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 11 011 010 066 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 11 011 010 068 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 3,414,649,400 as a signed binary written in one's complement representation May 17 11:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 5,243 as a signed binary written in one's complement representation May 17 11:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -289,141 as a signed binary written in one's complement representation May 17 11:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 35,170 as a signed binary written in one's complement representation May 17 11:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -4,096 as a signed binary written in one's complement representation May 17 11:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 9,223,372,036,854,775,806 as a signed binary written in one's complement representation May 17 11:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -78,700,386 as a signed binary written in one's complement representation May 17 11:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -83,411,084 as a signed binary written in one's complement representation May 17 11:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -1,292 as a signed binary written in one's complement representation May 17 11:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 100,109,898 as a signed binary written in one's complement representation May 17 11:03 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