Convert Decimal 11 100 011 128 to Signed Binary in One's (1's) Complement Representation

How to convert decimal number 11 100 011 128(10) to a signed binary in one's (1's) complement representation

What are the steps to convert decimal number
11 100 011 128 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;
  • 11 100 011 128 ÷ 2 = 5 550 005 564 + 0;
  • 5 550 005 564 ÷ 2 = 2 775 002 782 + 0;
  • 2 775 002 782 ÷ 2 = 1 387 501 391 + 0;
  • 1 387 501 391 ÷ 2 = 693 750 695 + 1;
  • 693 750 695 ÷ 2 = 346 875 347 + 1;
  • 346 875 347 ÷ 2 = 173 437 673 + 1;
  • 173 437 673 ÷ 2 = 86 718 836 + 1;
  • 86 718 836 ÷ 2 = 43 359 418 + 0;
  • 43 359 418 ÷ 2 = 21 679 709 + 0;
  • 21 679 709 ÷ 2 = 10 839 854 + 1;
  • 10 839 854 ÷ 2 = 5 419 927 + 0;
  • 5 419 927 ÷ 2 = 2 709 963 + 1;
  • 2 709 963 ÷ 2 = 1 354 981 + 1;
  • 1 354 981 ÷ 2 = 677 490 + 1;
  • 677 490 ÷ 2 = 338 745 + 0;
  • 338 745 ÷ 2 = 169 372 + 1;
  • 169 372 ÷ 2 = 84 686 + 0;
  • 84 686 ÷ 2 = 42 343 + 0;
  • 42 343 ÷ 2 = 21 171 + 1;
  • 21 171 ÷ 2 = 10 585 + 1;
  • 10 585 ÷ 2 = 5 292 + 1;
  • 5 292 ÷ 2 = 2 646 + 0;
  • 2 646 ÷ 2 = 1 323 + 0;
  • 1 323 ÷ 2 = 661 + 1;
  • 661 ÷ 2 = 330 + 1;
  • 330 ÷ 2 = 165 + 0;
  • 165 ÷ 2 = 82 + 1;
  • 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 100 011 128(10) = 10 1001 0101 1001 1100 1011 1010 0111 1000(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.


Decimal Number 11 100 011 128(10) converted to signed binary in one's complement representation:

11 100 011 128(10) = 0000 0000 0000 0000 0000 0000 0000 0010 1001 0101 1001 1100 1011 1010 0111 1000

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

Share

» More ops: Convert decimal 11 100 011 142 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 09, 2025 [September]: Decimal Numbers Converted to Signed Binary in One's (1's) Complement Representation. Calculations performed during the month of: September - by our visitors

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