Convert -47 061 713 804 088 to a Signed Binary in One's (1's) Complement Representation

How to convert decimal number -47 061 713 804 088(10) to a signed binary in one's (1's) complement representation

What are the steps to convert decimal number
-47 061 713 804 088 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. Start with the positive version of the number:

|-47 061 713 804 088| = 47 061 713 804 088

2. 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;
  • 47 061 713 804 088 ÷ 2 = 23 530 856 902 044 + 0;
  • 23 530 856 902 044 ÷ 2 = 11 765 428 451 022 + 0;
  • 11 765 428 451 022 ÷ 2 = 5 882 714 225 511 + 0;
  • 5 882 714 225 511 ÷ 2 = 2 941 357 112 755 + 1;
  • 2 941 357 112 755 ÷ 2 = 1 470 678 556 377 + 1;
  • 1 470 678 556 377 ÷ 2 = 735 339 278 188 + 1;
  • 735 339 278 188 ÷ 2 = 367 669 639 094 + 0;
  • 367 669 639 094 ÷ 2 = 183 834 819 547 + 0;
  • 183 834 819 547 ÷ 2 = 91 917 409 773 + 1;
  • 91 917 409 773 ÷ 2 = 45 958 704 886 + 1;
  • 45 958 704 886 ÷ 2 = 22 979 352 443 + 0;
  • 22 979 352 443 ÷ 2 = 11 489 676 221 + 1;
  • 11 489 676 221 ÷ 2 = 5 744 838 110 + 1;
  • 5 744 838 110 ÷ 2 = 2 872 419 055 + 0;
  • 2 872 419 055 ÷ 2 = 1 436 209 527 + 1;
  • 1 436 209 527 ÷ 2 = 718 104 763 + 1;
  • 718 104 763 ÷ 2 = 359 052 381 + 1;
  • 359 052 381 ÷ 2 = 179 526 190 + 1;
  • 179 526 190 ÷ 2 = 89 763 095 + 0;
  • 89 763 095 ÷ 2 = 44 881 547 + 1;
  • 44 881 547 ÷ 2 = 22 440 773 + 1;
  • 22 440 773 ÷ 2 = 11 220 386 + 1;
  • 11 220 386 ÷ 2 = 5 610 193 + 0;
  • 5 610 193 ÷ 2 = 2 805 096 + 1;
  • 2 805 096 ÷ 2 = 1 402 548 + 0;
  • 1 402 548 ÷ 2 = 701 274 + 0;
  • 701 274 ÷ 2 = 350 637 + 0;
  • 350 637 ÷ 2 = 175 318 + 1;
  • 175 318 ÷ 2 = 87 659 + 0;
  • 87 659 ÷ 2 = 43 829 + 1;
  • 43 829 ÷ 2 = 21 914 + 1;
  • 21 914 ÷ 2 = 10 957 + 0;
  • 10 957 ÷ 2 = 5 478 + 1;
  • 5 478 ÷ 2 = 2 739 + 0;
  • 2 739 ÷ 2 = 1 369 + 1;
  • 1 369 ÷ 2 = 684 + 1;
  • 684 ÷ 2 = 342 + 0;
  • 342 ÷ 2 = 171 + 0;
  • 171 ÷ 2 = 85 + 1;
  • 85 ÷ 2 = 42 + 1;
  • 42 ÷ 2 = 21 + 0;
  • 21 ÷ 2 = 10 + 1;
  • 10 ÷ 2 = 5 + 0;
  • 5 ÷ 2 = 2 + 1;
  • 2 ÷ 2 = 1 + 0;
  • 1 ÷ 2 = 0 + 1;

3. Construct the base 2 representation of the positive number:

Take all the remainders starting from the bottom of the list constructed above.

47 061 713 804 088(10) = 10 1010 1100 1101 0110 1000 1011 1011 1101 1011 0011 1000(2)

4. Determine the signed binary number bit length:

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

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

3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)

=== is: 64.


5. 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.


47 061 713 804 088(10) = 0000 0000 0000 0000 0010 1010 1100 1101 0110 1000 1011 1011 1101 1011 0011 1000

6. Get the negative integer number representation:

  • To write the negative integer number on 64 bits (8 Bytes), as a signed binary in one's complement representation,

  • ... Reverse all the bits from 0 to 1 and from 1 to 0 (flip the digits).


-47 061 713 804 088(10) = !(0000 0000 0000 0000 0010 1010 1100 1101 0110 1000 1011 1011 1101 1011 0011 1000)


Decimal Number -47 061 713 804 088(10) converted to signed binary in one's complement representation:

-47 061 713 804 088(10) = 1111 1111 1111 1111 1101 0101 0011 0010 1001 0111 0100 0100 0010 0100 1100 0111

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

Share

» More ops: Convert decimal -47 061 713 804 104 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 06, 2026 [June]: Decimal Numbers Converted to Signed Binary in One's (1's) Complement Representation. Calculations performed during the month of: June - by our visitors

» Improve your social skills: Your Greatest Competitor, 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