Convert 100 011 011 049 to a Signed Binary in One's (1's) Complement Representation

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

What are the steps to convert decimal number
100 011 011 049 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;
  • 100 011 011 049 ÷ 2 = 50 005 505 524 + 1;
  • 50 005 505 524 ÷ 2 = 25 002 752 762 + 0;
  • 25 002 752 762 ÷ 2 = 12 501 376 381 + 0;
  • 12 501 376 381 ÷ 2 = 6 250 688 190 + 1;
  • 6 250 688 190 ÷ 2 = 3 125 344 095 + 0;
  • 3 125 344 095 ÷ 2 = 1 562 672 047 + 1;
  • 1 562 672 047 ÷ 2 = 781 336 023 + 1;
  • 781 336 023 ÷ 2 = 390 668 011 + 1;
  • 390 668 011 ÷ 2 = 195 334 005 + 1;
  • 195 334 005 ÷ 2 = 97 667 002 + 1;
  • 97 667 002 ÷ 2 = 48 833 501 + 0;
  • 48 833 501 ÷ 2 = 24 416 750 + 1;
  • 24 416 750 ÷ 2 = 12 208 375 + 0;
  • 12 208 375 ÷ 2 = 6 104 187 + 1;
  • 6 104 187 ÷ 2 = 3 052 093 + 1;
  • 3 052 093 ÷ 2 = 1 526 046 + 1;
  • 1 526 046 ÷ 2 = 763 023 + 0;
  • 763 023 ÷ 2 = 381 511 + 1;
  • 381 511 ÷ 2 = 190 755 + 1;
  • 190 755 ÷ 2 = 95 377 + 1;
  • 95 377 ÷ 2 = 47 688 + 1;
  • 47 688 ÷ 2 = 23 844 + 0;
  • 23 844 ÷ 2 = 11 922 + 0;
  • 11 922 ÷ 2 = 5 961 + 0;
  • 5 961 ÷ 2 = 2 980 + 1;
  • 2 980 ÷ 2 = 1 490 + 0;
  • 1 490 ÷ 2 = 745 + 0;
  • 745 ÷ 2 = 372 + 1;
  • 372 ÷ 2 = 186 + 0;
  • 186 ÷ 2 = 93 + 0;
  • 93 ÷ 2 = 46 + 1;
  • 46 ÷ 2 = 23 + 0;
  • 23 ÷ 2 = 11 + 1;
  • 11 ÷ 2 = 5 + 1;
  • 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.

100 011 011 049(10) = 1 0111 0100 1001 0001 1110 1110 1011 1110 1001(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 100 011 011 049(10) converted to signed binary in one's complement representation:

100 011 011 049(10) = 0000 0000 0000 0000 0000 0000 0001 0111 0100 1001 0001 1110 1110 1011 1110 1001

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

Share

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

» Improve your social skills: Your Greatest Competitor, Your Most Powerful Ally. Gemini Notebook 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