Convert 1 110 011 698 to a Signed Binary in One's (1's) Complement Representation

How to convert decimal number 1 110 011 698(10) to a signed binary in one's (1's) complement representation

What are the steps to convert decimal number
1 110 011 698 to a signed binary in one's (1's) complement representation?

  • A signed integer, written in base ten, or a decimal system number, is a number written using the digits 0 through 9 and the sign, which can be positive (+) or negative (-). If positive, the sign is usually not written. A number written in base two, or binary, is a number written using only the digits 0 and 1.

1. Divide the number repeatedly by 2:

Keep track of each remainder.

Stop when you get a quotient that is equal to zero.


  • division = quotient + remainder;
  • 1 110 011 698 ÷ 2 = 555 005 849 + 0;
  • 555 005 849 ÷ 2 = 277 502 924 + 1;
  • 277 502 924 ÷ 2 = 138 751 462 + 0;
  • 138 751 462 ÷ 2 = 69 375 731 + 0;
  • 69 375 731 ÷ 2 = 34 687 865 + 1;
  • 34 687 865 ÷ 2 = 17 343 932 + 1;
  • 17 343 932 ÷ 2 = 8 671 966 + 0;
  • 8 671 966 ÷ 2 = 4 335 983 + 0;
  • 4 335 983 ÷ 2 = 2 167 991 + 1;
  • 2 167 991 ÷ 2 = 1 083 995 + 1;
  • 1 083 995 ÷ 2 = 541 997 + 1;
  • 541 997 ÷ 2 = 270 998 + 1;
  • 270 998 ÷ 2 = 135 499 + 0;
  • 135 499 ÷ 2 = 67 749 + 1;
  • 67 749 ÷ 2 = 33 874 + 1;
  • 33 874 ÷ 2 = 16 937 + 0;
  • 16 937 ÷ 2 = 8 468 + 1;
  • 8 468 ÷ 2 = 4 234 + 0;
  • 4 234 ÷ 2 = 2 117 + 0;
  • 2 117 ÷ 2 = 1 058 + 1;
  • 1 058 ÷ 2 = 529 + 0;
  • 529 ÷ 2 = 264 + 1;
  • 264 ÷ 2 = 132 + 0;
  • 132 ÷ 2 = 66 + 0;
  • 66 ÷ 2 = 33 + 0;
  • 33 ÷ 2 = 16 + 1;
  • 16 ÷ 2 = 8 + 0;
  • 8 ÷ 2 = 4 + 0;
  • 4 ÷ 2 = 2 + 0;
  • 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.

1 110 011 698(10) = 100 0010 0010 1001 0110 1111 0011 0010(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.


Decimal Number 1 110 011 698(10) converted to signed binary in one's complement representation:

1 110 011 698(10) = 0100 0010 0010 1001 0110 1111 0011 0010

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

Share

» More ops: Convert decimal 1 110 011 669 to signed binary in one's (1's) complement representation

» Calculations Performed by Our Visitors: Decimal Numbers Converted to Signed Binary in One's (1's) Complement Representation. Data organized on a Monthly Basis

» Month 03, 2026 [March]: Decimal Numbers Converted to Signed Binary in One's (1's) Complement Representation. Calculations performed during the month of: March - by our visitors

» Improve your social skills: Your greatest rival, your most powerful ally. NotebookLM YouTube Video of 7.54 minutes

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