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

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

What are the steps to convert decimal number
110 011 110 384 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;
  • 110 011 110 384 ÷ 2 = 55 005 555 192 + 0;
  • 55 005 555 192 ÷ 2 = 27 502 777 596 + 0;
  • 27 502 777 596 ÷ 2 = 13 751 388 798 + 0;
  • 13 751 388 798 ÷ 2 = 6 875 694 399 + 0;
  • 6 875 694 399 ÷ 2 = 3 437 847 199 + 1;
  • 3 437 847 199 ÷ 2 = 1 718 923 599 + 1;
  • 1 718 923 599 ÷ 2 = 859 461 799 + 1;
  • 859 461 799 ÷ 2 = 429 730 899 + 1;
  • 429 730 899 ÷ 2 = 214 865 449 + 1;
  • 214 865 449 ÷ 2 = 107 432 724 + 1;
  • 107 432 724 ÷ 2 = 53 716 362 + 0;
  • 53 716 362 ÷ 2 = 26 858 181 + 0;
  • 26 858 181 ÷ 2 = 13 429 090 + 1;
  • 13 429 090 ÷ 2 = 6 714 545 + 0;
  • 6 714 545 ÷ 2 = 3 357 272 + 1;
  • 3 357 272 ÷ 2 = 1 678 636 + 0;
  • 1 678 636 ÷ 2 = 839 318 + 0;
  • 839 318 ÷ 2 = 419 659 + 0;
  • 419 659 ÷ 2 = 209 829 + 1;
  • 209 829 ÷ 2 = 104 914 + 1;
  • 104 914 ÷ 2 = 52 457 + 0;
  • 52 457 ÷ 2 = 26 228 + 1;
  • 26 228 ÷ 2 = 13 114 + 0;
  • 13 114 ÷ 2 = 6 557 + 0;
  • 6 557 ÷ 2 = 3 278 + 1;
  • 3 278 ÷ 2 = 1 639 + 0;
  • 1 639 ÷ 2 = 819 + 1;
  • 819 ÷ 2 = 409 + 1;
  • 409 ÷ 2 = 204 + 1;
  • 204 ÷ 2 = 102 + 0;
  • 102 ÷ 2 = 51 + 0;
  • 51 ÷ 2 = 25 + 1;
  • 25 ÷ 2 = 12 + 1;
  • 12 ÷ 2 = 6 + 0;
  • 6 ÷ 2 = 3 + 0;
  • 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.

110 011 110 384(10) = 1 1001 1001 1101 0010 1100 0101 0011 1111 0000(2)

3. Determine the signed binary number bit length:

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

  • 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, 37,

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.


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

110 011 110 384(10) = 0000 0000 0000 0000 0000 0000 0001 1001 1001 1101 0010 1100 0101 0011 1111 0000

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

Share

» More ops: Convert decimal 110 011 110 415 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 08, 2026 [August]: Decimal Numbers Converted to Signed Binary in One's (1's) Complement Representation. Calculations performed during the month of: August - by our visitors

» Improve your social skills: The Art of Strategic Ambiguity. Gemini Notebook YouTube Video of 6.59 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