Convert -4 413 527 634 823 086 068 to a signed binary in two's complement representation, from a signed integer number in base 10 decimal system

-4 413 527 634 823 086 068(10) to a signed binary two's complement representation = ?

1. Start with the positive version of the number:

|-4 413 527 634 823 086 068| = 4 413 527 634 823 086 068

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;
  • 4 413 527 634 823 086 068 ÷ 2 = 2 206 763 817 411 543 034 + 0;
  • 2 206 763 817 411 543 034 ÷ 2 = 1 103 381 908 705 771 517 + 0;
  • 1 103 381 908 705 771 517 ÷ 2 = 551 690 954 352 885 758 + 1;
  • 551 690 954 352 885 758 ÷ 2 = 275 845 477 176 442 879 + 0;
  • 275 845 477 176 442 879 ÷ 2 = 137 922 738 588 221 439 + 1;
  • 137 922 738 588 221 439 ÷ 2 = 68 961 369 294 110 719 + 1;
  • 68 961 369 294 110 719 ÷ 2 = 34 480 684 647 055 359 + 1;
  • 34 480 684 647 055 359 ÷ 2 = 17 240 342 323 527 679 + 1;
  • 17 240 342 323 527 679 ÷ 2 = 8 620 171 161 763 839 + 1;
  • 8 620 171 161 763 839 ÷ 2 = 4 310 085 580 881 919 + 1;
  • 4 310 085 580 881 919 ÷ 2 = 2 155 042 790 440 959 + 1;
  • 2 155 042 790 440 959 ÷ 2 = 1 077 521 395 220 479 + 1;
  • 1 077 521 395 220 479 ÷ 2 = 538 760 697 610 239 + 1;
  • 538 760 697 610 239 ÷ 2 = 269 380 348 805 119 + 1;
  • 269 380 348 805 119 ÷ 2 = 134 690 174 402 559 + 1;
  • 134 690 174 402 559 ÷ 2 = 67 345 087 201 279 + 1;
  • 67 345 087 201 279 ÷ 2 = 33 672 543 600 639 + 1;
  • 33 672 543 600 639 ÷ 2 = 16 836 271 800 319 + 1;
  • 16 836 271 800 319 ÷ 2 = 8 418 135 900 159 + 1;
  • 8 418 135 900 159 ÷ 2 = 4 209 067 950 079 + 1;
  • 4 209 067 950 079 ÷ 2 = 2 104 533 975 039 + 1;
  • 2 104 533 975 039 ÷ 2 = 1 052 266 987 519 + 1;
  • 1 052 266 987 519 ÷ 2 = 526 133 493 759 + 1;
  • 526 133 493 759 ÷ 2 = 263 066 746 879 + 1;
  • 263 066 746 879 ÷ 2 = 131 533 373 439 + 1;
  • 131 533 373 439 ÷ 2 = 65 766 686 719 + 1;
  • 65 766 686 719 ÷ 2 = 32 883 343 359 + 1;
  • 32 883 343 359 ÷ 2 = 16 441 671 679 + 1;
  • 16 441 671 679 ÷ 2 = 8 220 835 839 + 1;
  • 8 220 835 839 ÷ 2 = 4 110 417 919 + 1;
  • 4 110 417 919 ÷ 2 = 2 055 208 959 + 1;
  • 2 055 208 959 ÷ 2 = 1 027 604 479 + 1;
  • 1 027 604 479 ÷ 2 = 513 802 239 + 1;
  • 513 802 239 ÷ 2 = 256 901 119 + 1;
  • 256 901 119 ÷ 2 = 128 450 559 + 1;
  • 128 450 559 ÷ 2 = 64 225 279 + 1;
  • 64 225 279 ÷ 2 = 32 112 639 + 1;
  • 32 112 639 ÷ 2 = 16 056 319 + 1;
  • 16 056 319 ÷ 2 = 8 028 159 + 1;
  • 8 028 159 ÷ 2 = 4 014 079 + 1;
  • 4 014 079 ÷ 2 = 2 007 039 + 1;
  • 2 007 039 ÷ 2 = 1 003 519 + 1;
  • 1 003 519 ÷ 2 = 501 759 + 1;
  • 501 759 ÷ 2 = 250 879 + 1;
  • 250 879 ÷ 2 = 125 439 + 1;
  • 125 439 ÷ 2 = 62 719 + 1;
  • 62 719 ÷ 2 = 31 359 + 1;
  • 31 359 ÷ 2 = 15 679 + 1;
  • 15 679 ÷ 2 = 7 839 + 1;
  • 7 839 ÷ 2 = 3 919 + 1;
  • 3 919 ÷ 2 = 1 959 + 1;
  • 1 959 ÷ 2 = 979 + 1;
  • 979 ÷ 2 = 489 + 1;
  • 489 ÷ 2 = 244 + 1;
  • 244 ÷ 2 = 122 + 0;
  • 122 ÷ 2 = 61 + 0;
  • 61 ÷ 2 = 30 + 1;
  • 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:

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

4 413 527 634 823 086 068(10) = 11 1101 0011 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 0100(2)


4. Determine the signed binary number bit length:

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

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

First bit (the leftmost) indicates the sign,
1 = negative, 0 = positive.

The least number that is:


a power of 2


and is larger than the actual length, 62,


so that the first bit (leftmost) could be zero


(we deal with a positive number at this moment)


is: 64.


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

4 413 527 634 823 086 068(10) = 0011 1101 0011 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 0100


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

To get the negative integer number representation on 64 bits (8 Bytes),


signed binary one's complement,


replace all the bits on 0 with 1s


and all the bits set on 1 with 0s


(reverse the digits, flip the digits)


!(0011 1101 0011 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 0100) =


1100 0010 1100 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 1011


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

To get the negative integer number representation on 64 bits (8 Bytes),


signed binary two's complement,


add 1 to the number calculated above


1100 0010 1100 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 1011 + 1 =


1100 0010 1100 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 1100


Number -4 413 527 634 823 086 068, a signed integer, converted from decimal system (base 10) to a signed binary two's complement representation:

-4 413 527 634 823 086 068(10) = 1100 0010 1100 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 1100

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


More operations of this kind:

-4 413 527 634 823 086 069 = ? | -4 413 527 634 823 086 067 = ?


Convert signed integer numbers from the decimal system (base ten) to signed binary two's complement representation

How to convert a base 10 signed integer number to signed binary in two's complement representation:

1) Divide the positive version of number repeatedly by 2, keeping track of each remainder, till getting a quotient that is equal to 0.

2) Construct the base 2 representation by taking the previously calculated remainders starting from the last remainder up to the first one, in that order.

3) Construct the positive binary computer representation so that the first bit is 0.

4) Only if the initial number is negative, switch all the bits from 0 to 1 and from 1 to 0 (reversing the digits).

5) Only if the initial number is negative, add 1 to the number at the previous point.

Latest signed integers converted from decimal system to binary two's complement representation

-4,413,527,634,823,086,068 to signed binary two's complement = ? May 18 01:06 UTC (GMT)
931,354 to signed binary two's complement = ? May 18 01:06 UTC (GMT)
202,017 to signed binary two's complement = ? May 18 01:05 UTC (GMT)
-655,378 to signed binary two's complement = ? May 18 01:05 UTC (GMT)
-9,218,868,437,227,405,334 to signed binary two's complement = ? May 18 01:05 UTC (GMT)
12,616,274 to signed binary two's complement = ? May 18 01:04 UTC (GMT)
-4,339 to signed binary two's complement = ? May 18 01:04 UTC (GMT)
-65,024 to signed binary two's complement = ? May 18 01:04 UTC (GMT)
10,000,948 to signed binary two's complement = ? May 18 01:04 UTC (GMT)
20,965 to signed binary two's complement = ? May 18 01:03 UTC (GMT)
-5,483 to signed binary two's complement = ? May 18 01:03 UTC (GMT)
-1,011,108 to signed binary two's complement = ? May 18 01:03 UTC (GMT)
-1,414,812,770 to signed binary two's complement = ? May 18 01:03 UTC (GMT)
All decimal integer numbers converted to signed binary two's complement representation

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