Convert -5 970 836 374 057 710 100 to a Signed Binary in Two's (2's) Complement Representation

How to convert decimal number -5 970 836 374 057 710 100(10) to a signed binary in two's (2's) complement representation

What are the steps to convert decimal number
-5 970 836 374 057 710 100 to a signed binary in two's (2'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:

|-5 970 836 374 057 710 100| = 5 970 836 374 057 710 100

2. Divide the number repeatedly by 2:

Keep track of each remainder.

We stop when we get a quotient that is equal to zero.


  • division = quotient + remainder;
  • 5 970 836 374 057 710 100 ÷ 2 = 2 985 418 187 028 855 050 + 0;
  • 2 985 418 187 028 855 050 ÷ 2 = 1 492 709 093 514 427 525 + 0;
  • 1 492 709 093 514 427 525 ÷ 2 = 746 354 546 757 213 762 + 1;
  • 746 354 546 757 213 762 ÷ 2 = 373 177 273 378 606 881 + 0;
  • 373 177 273 378 606 881 ÷ 2 = 186 588 636 689 303 440 + 1;
  • 186 588 636 689 303 440 ÷ 2 = 93 294 318 344 651 720 + 0;
  • 93 294 318 344 651 720 ÷ 2 = 46 647 159 172 325 860 + 0;
  • 46 647 159 172 325 860 ÷ 2 = 23 323 579 586 162 930 + 0;
  • 23 323 579 586 162 930 ÷ 2 = 11 661 789 793 081 465 + 0;
  • 11 661 789 793 081 465 ÷ 2 = 5 830 894 896 540 732 + 1;
  • 5 830 894 896 540 732 ÷ 2 = 2 915 447 448 270 366 + 0;
  • 2 915 447 448 270 366 ÷ 2 = 1 457 723 724 135 183 + 0;
  • 1 457 723 724 135 183 ÷ 2 = 728 861 862 067 591 + 1;
  • 728 861 862 067 591 ÷ 2 = 364 430 931 033 795 + 1;
  • 364 430 931 033 795 ÷ 2 = 182 215 465 516 897 + 1;
  • 182 215 465 516 897 ÷ 2 = 91 107 732 758 448 + 1;
  • 91 107 732 758 448 ÷ 2 = 45 553 866 379 224 + 0;
  • 45 553 866 379 224 ÷ 2 = 22 776 933 189 612 + 0;
  • 22 776 933 189 612 ÷ 2 = 11 388 466 594 806 + 0;
  • 11 388 466 594 806 ÷ 2 = 5 694 233 297 403 + 0;
  • 5 694 233 297 403 ÷ 2 = 2 847 116 648 701 + 1;
  • 2 847 116 648 701 ÷ 2 = 1 423 558 324 350 + 1;
  • 1 423 558 324 350 ÷ 2 = 711 779 162 175 + 0;
  • 711 779 162 175 ÷ 2 = 355 889 581 087 + 1;
  • 355 889 581 087 ÷ 2 = 177 944 790 543 + 1;
  • 177 944 790 543 ÷ 2 = 88 972 395 271 + 1;
  • 88 972 395 271 ÷ 2 = 44 486 197 635 + 1;
  • 44 486 197 635 ÷ 2 = 22 243 098 817 + 1;
  • 22 243 098 817 ÷ 2 = 11 121 549 408 + 1;
  • 11 121 549 408 ÷ 2 = 5 560 774 704 + 0;
  • 5 560 774 704 ÷ 2 = 2 780 387 352 + 0;
  • 2 780 387 352 ÷ 2 = 1 390 193 676 + 0;
  • 1 390 193 676 ÷ 2 = 695 096 838 + 0;
  • 695 096 838 ÷ 2 = 347 548 419 + 0;
  • 347 548 419 ÷ 2 = 173 774 209 + 1;
  • 173 774 209 ÷ 2 = 86 887 104 + 1;
  • 86 887 104 ÷ 2 = 43 443 552 + 0;
  • 43 443 552 ÷ 2 = 21 721 776 + 0;
  • 21 721 776 ÷ 2 = 10 860 888 + 0;
  • 10 860 888 ÷ 2 = 5 430 444 + 0;
  • 5 430 444 ÷ 2 = 2 715 222 + 0;
  • 2 715 222 ÷ 2 = 1 357 611 + 0;
  • 1 357 611 ÷ 2 = 678 805 + 1;
  • 678 805 ÷ 2 = 339 402 + 1;
  • 339 402 ÷ 2 = 169 701 + 0;
  • 169 701 ÷ 2 = 84 850 + 1;
  • 84 850 ÷ 2 = 42 425 + 0;
  • 42 425 ÷ 2 = 21 212 + 1;
  • 21 212 ÷ 2 = 10 606 + 0;
  • 10 606 ÷ 2 = 5 303 + 0;
  • 5 303 ÷ 2 = 2 651 + 1;
  • 2 651 ÷ 2 = 1 325 + 1;
  • 1 325 ÷ 2 = 662 + 1;
  • 662 ÷ 2 = 331 + 0;
  • 331 ÷ 2 = 165 + 1;
  • 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;

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

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

5 970 836 374 057 710 100(10) = 101 0010 1101 1100 1010 1100 0000 1100 0001 1111 1011 0000 1111 0010 0001 0100(2)

4. Determine the signed binary number bit length:

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

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

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.


5 970 836 374 057 710 100(10) = 0101 0010 1101 1100 1010 1100 0000 1100 0001 1111 1011 0000 1111 0010 0001 0100

6. Get the negative integer number representation. Part 1:

  • To write the negative integer number on 64 bits (8 Bytes), as a signed binary in one's complement representation, replace all the bits on 0 with 1s and all the bits set on 1 with 0s.

Reverse the digits, flip the digits:

Replace the bits set on 0 with 1s and the bits set on 1 with 0s.

!(0101 0010 1101 1100 1010 1100 0000 1100 0001 1111 1011 0000 1111 0010 0001 0100)

= 1010 1101 0010 0011 0101 0011 1111 0011 1110 0000 0100 1111 0000 1101 1110 1011


7. Get the negative integer number representation. Part 2:

  • To write the negative integer number on 64 bits (8 Bytes), as a signed binary in two's complement representation, add 1 to the number calculated above 1010 1101 0010 0011 0101 0011 1111 0011 1110 0000 0100 1111 0000 1101 1110 1011 (to the signed binary in one's complement representation).

Binary addition carries on a value of 2:

  • 0 + 0 = 0
  • 0 + 1 = 1
  • 1 + 1 = 10
  • 1 + 10 = 11
  • 1 + 11 = 100

Add 1 to the number calculated above
(to the signed binary number in one's complement representation):

-5 970 836 374 057 710 100 =

1010 1101 0010 0011 0101 0011 1111 0011 1110 0000 0100 1111 0000 1101 1110 1011 + 1


Decimal Number -5 970 836 374 057 710 100(10) converted to signed binary in two's complement representation:

-5 970 836 374 057 710 100(10) = 1010 1101 0010 0011 0101 0011 1111 0011 1110 0000 0100 1111 0000 1101 1110 1100

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

Share

» More ops: Convert decimal -5 970 836 374 057 710 126 to signed binary in two's (2's) complement representation

» Calculations Performed by Our Visitors: Decimal Numbers Converted to Signed Binary in Two's (2's) Complement Representation. Data organized on a Monthly Basis

» Month 06, 2026 [June]: Decimal Numbers Converted to Signed Binary in Two's (2's) Complement Representation. Calculations performed during the month of: June - by our visitors

» Improve your social skills: Are you using communication by design, or by default? NotebookLM YouTube Video of 6.33 minutes

How to convert signed integers from decimal system to signed binary in two's complement representation

Follow the steps below to convert a signed base 10 integer number to signed binary in two'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, keeping track of each remainder, until we get a quotient that is 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, add extra bits on 0 in front (to the left) of the base 2 number above, up to the required length, so that the first bit (the leftmost) will 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 1s and all 1 bits with 0s (reversing the digits).
  • 6. To get the negative integer number, in signed binary two's complement representation, add 1 to the number above.

Example: convert the negative number -60 from the decimal system (base ten) to signed binary in two's complement:

  • 1. Start with the positive version of the number: |-60| = 60
  • 2. Divide repeatedly 60 by 2, keeping track of each remainder:
    • division = quotient + remainder
    • 60 ÷ 2 = 30 + 0
    • 30 ÷ 2 = 15 + 0
    • 15 ÷ 2 = 7 + 1
    • 7 ÷ 2 = 3 + 1
    • 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:
    60(10) = 11 1100(2)
  • 4. Bit length of base 2 representation number is 6, so the positive binary computer representation of a signed binary will take in this particular case 8 bits (the least power of 2 larger than 6) - add extra 0 digits in front of the base 2 number, up to the required length:
    60(10) = 0011 1100(2)
  • 5. To get the negative integer number representation in signed binary one's complement, replace all the 0 bits with 1s and all 1 bits with 0s (reversing the digits):
    !(0011 1100) = 1100 0011
  • 6. To get the negative integer number, signed binary in two's complement representation, add 1 to the number above:
    -60(10) = 1100 0011 + 1 = 1100 0100
  • Number -60(10), signed integer, converted from decimal system (base 10) to signed binary two's complement representation = 1100 0100