Convert 49 312 333 857 to a Signed Binary in One's (1's) Complement Representation

How to convert decimal number 49 312 333 857(10) to a signed binary in one's (1's) complement representation

What are the steps to convert decimal number
49 312 333 857 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;
  • 49 312 333 857 ÷ 2 = 24 656 166 928 + 1;
  • 24 656 166 928 ÷ 2 = 12 328 083 464 + 0;
  • 12 328 083 464 ÷ 2 = 6 164 041 732 + 0;
  • 6 164 041 732 ÷ 2 = 3 082 020 866 + 0;
  • 3 082 020 866 ÷ 2 = 1 541 010 433 + 0;
  • 1 541 010 433 ÷ 2 = 770 505 216 + 1;
  • 770 505 216 ÷ 2 = 385 252 608 + 0;
  • 385 252 608 ÷ 2 = 192 626 304 + 0;
  • 192 626 304 ÷ 2 = 96 313 152 + 0;
  • 96 313 152 ÷ 2 = 48 156 576 + 0;
  • 48 156 576 ÷ 2 = 24 078 288 + 0;
  • 24 078 288 ÷ 2 = 12 039 144 + 0;
  • 12 039 144 ÷ 2 = 6 019 572 + 0;
  • 6 019 572 ÷ 2 = 3 009 786 + 0;
  • 3 009 786 ÷ 2 = 1 504 893 + 0;
  • 1 504 893 ÷ 2 = 752 446 + 1;
  • 752 446 ÷ 2 = 376 223 + 0;
  • 376 223 ÷ 2 = 188 111 + 1;
  • 188 111 ÷ 2 = 94 055 + 1;
  • 94 055 ÷ 2 = 47 027 + 1;
  • 47 027 ÷ 2 = 23 513 + 1;
  • 23 513 ÷ 2 = 11 756 + 1;
  • 11 756 ÷ 2 = 5 878 + 0;
  • 5 878 ÷ 2 = 2 939 + 0;
  • 2 939 ÷ 2 = 1 469 + 1;
  • 1 469 ÷ 2 = 734 + 1;
  • 734 ÷ 2 = 367 + 0;
  • 367 ÷ 2 = 183 + 1;
  • 183 ÷ 2 = 91 + 1;
  • 91 ÷ 2 = 45 + 1;
  • 45 ÷ 2 = 22 + 1;
  • 22 ÷ 2 = 11 + 0;
  • 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.

49 312 333 857(10) = 1011 0111 1011 0011 1110 1000 0000 0010 0001(2)

3. Determine the signed binary number bit length:

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

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

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 49 312 333 857(10) converted to signed binary in one's complement representation:

49 312 333 857(10) = 0000 0000 0000 0000 0000 0000 0000 1011 0111 1011 0011 1110 1000 0000 0010 0001

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

Share

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

» Improve your social skills: Why Do Colleagues From Other Teams Have Better Results? Gemini Notebook YouTube Video of 11.31 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