0.728 822 019 999 999 959 338 765 620 486 810 803 413 390 09 Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal 0.728 822 019 999 999 959 338 765 620 486 810 803 413 390 09(10) to 64 bit double precision IEEE 754 binary floating point representation standard (1 bit for sign, 11 bits for exponent, 52 bits for mantissa)

What are the steps to convert decimal number
0.728 822 019 999 999 959 338 765 620 486 810 803 413 390 09(10) to 64 bit double precision IEEE 754 binary floating point representation (1 bit for sign, 11 bits for exponent, 52 bits for mantissa)

1. First, convert to binary (in base 2) the integer part: 0.
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;
  • 0 ÷ 2 = 0 + 0;

2. Construct the base 2 representation of the integer part of the number.

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

0(10) =

0(2)


3. Convert to binary (base 2) the fractional part: 0.728 822 019 999 999 959 338 765 620 486 810 803 413 390 09.

Multiply it repeatedly by 2.

Keep track of each integer part of the results.

Stop when we get a fractional part that is equal to zero.


  • #) multiplying = integer + fractional part;
  • 1) 0.728 822 019 999 999 959 338 765 620 486 810 803 413 390 09 × 2 = 1 + 0.457 644 039 999 999 918 677 531 240 973 621 606 826 780 18;
  • 2) 0.457 644 039 999 999 918 677 531 240 973 621 606 826 780 18 × 2 = 0 + 0.915 288 079 999 999 837 355 062 481 947 243 213 653 560 36;
  • 3) 0.915 288 079 999 999 837 355 062 481 947 243 213 653 560 36 × 2 = 1 + 0.830 576 159 999 999 674 710 124 963 894 486 427 307 120 72;
  • 4) 0.830 576 159 999 999 674 710 124 963 894 486 427 307 120 72 × 2 = 1 + 0.661 152 319 999 999 349 420 249 927 788 972 854 614 241 44;
  • 5) 0.661 152 319 999 999 349 420 249 927 788 972 854 614 241 44 × 2 = 1 + 0.322 304 639 999 998 698 840 499 855 577 945 709 228 482 88;
  • 6) 0.322 304 639 999 998 698 840 499 855 577 945 709 228 482 88 × 2 = 0 + 0.644 609 279 999 997 397 680 999 711 155 891 418 456 965 76;
  • 7) 0.644 609 279 999 997 397 680 999 711 155 891 418 456 965 76 × 2 = 1 + 0.289 218 559 999 994 795 361 999 422 311 782 836 913 931 52;
  • 8) 0.289 218 559 999 994 795 361 999 422 311 782 836 913 931 52 × 2 = 0 + 0.578 437 119 999 989 590 723 998 844 623 565 673 827 863 04;
  • 9) 0.578 437 119 999 989 590 723 998 844 623 565 673 827 863 04 × 2 = 1 + 0.156 874 239 999 979 181 447 997 689 247 131 347 655 726 08;
  • 10) 0.156 874 239 999 979 181 447 997 689 247 131 347 655 726 08 × 2 = 0 + 0.313 748 479 999 958 362 895 995 378 494 262 695 311 452 16;
  • 11) 0.313 748 479 999 958 362 895 995 378 494 262 695 311 452 16 × 2 = 0 + 0.627 496 959 999 916 725 791 990 756 988 525 390 622 904 32;
  • 12) 0.627 496 959 999 916 725 791 990 756 988 525 390 622 904 32 × 2 = 1 + 0.254 993 919 999 833 451 583 981 513 977 050 781 245 808 64;
  • 13) 0.254 993 919 999 833 451 583 981 513 977 050 781 245 808 64 × 2 = 0 + 0.509 987 839 999 666 903 167 963 027 954 101 562 491 617 28;
  • 14) 0.509 987 839 999 666 903 167 963 027 954 101 562 491 617 28 × 2 = 1 + 0.019 975 679 999 333 806 335 926 055 908 203 124 983 234 56;
  • 15) 0.019 975 679 999 333 806 335 926 055 908 203 124 983 234 56 × 2 = 0 + 0.039 951 359 998 667 612 671 852 111 816 406 249 966 469 12;
  • 16) 0.039 951 359 998 667 612 671 852 111 816 406 249 966 469 12 × 2 = 0 + 0.079 902 719 997 335 225 343 704 223 632 812 499 932 938 24;
  • 17) 0.079 902 719 997 335 225 343 704 223 632 812 499 932 938 24 × 2 = 0 + 0.159 805 439 994 670 450 687 408 447 265 624 999 865 876 48;
  • 18) 0.159 805 439 994 670 450 687 408 447 265 624 999 865 876 48 × 2 = 0 + 0.319 610 879 989 340 901 374 816 894 531 249 999 731 752 96;
  • 19) 0.319 610 879 989 340 901 374 816 894 531 249 999 731 752 96 × 2 = 0 + 0.639 221 759 978 681 802 749 633 789 062 499 999 463 505 92;
  • 20) 0.639 221 759 978 681 802 749 633 789 062 499 999 463 505 92 × 2 = 1 + 0.278 443 519 957 363 605 499 267 578 124 999 998 927 011 84;
  • 21) 0.278 443 519 957 363 605 499 267 578 124 999 998 927 011 84 × 2 = 0 + 0.556 887 039 914 727 210 998 535 156 249 999 997 854 023 68;
  • 22) 0.556 887 039 914 727 210 998 535 156 249 999 997 854 023 68 × 2 = 1 + 0.113 774 079 829 454 421 997 070 312 499 999 995 708 047 36;
  • 23) 0.113 774 079 829 454 421 997 070 312 499 999 995 708 047 36 × 2 = 0 + 0.227 548 159 658 908 843 994 140 624 999 999 991 416 094 72;
  • 24) 0.227 548 159 658 908 843 994 140 624 999 999 991 416 094 72 × 2 = 0 + 0.455 096 319 317 817 687 988 281 249 999 999 982 832 189 44;
  • 25) 0.455 096 319 317 817 687 988 281 249 999 999 982 832 189 44 × 2 = 0 + 0.910 192 638 635 635 375 976 562 499 999 999 965 664 378 88;
  • 26) 0.910 192 638 635 635 375 976 562 499 999 999 965 664 378 88 × 2 = 1 + 0.820 385 277 271 270 751 953 124 999 999 999 931 328 757 76;
  • 27) 0.820 385 277 271 270 751 953 124 999 999 999 931 328 757 76 × 2 = 1 + 0.640 770 554 542 541 503 906 249 999 999 999 862 657 515 52;
  • 28) 0.640 770 554 542 541 503 906 249 999 999 999 862 657 515 52 × 2 = 1 + 0.281 541 109 085 083 007 812 499 999 999 999 725 315 031 04;
  • 29) 0.281 541 109 085 083 007 812 499 999 999 999 725 315 031 04 × 2 = 0 + 0.563 082 218 170 166 015 624 999 999 999 999 450 630 062 08;
  • 30) 0.563 082 218 170 166 015 624 999 999 999 999 450 630 062 08 × 2 = 1 + 0.126 164 436 340 332 031 249 999 999 999 998 901 260 124 16;
  • 31) 0.126 164 436 340 332 031 249 999 999 999 998 901 260 124 16 × 2 = 0 + 0.252 328 872 680 664 062 499 999 999 999 997 802 520 248 32;
  • 32) 0.252 328 872 680 664 062 499 999 999 999 997 802 520 248 32 × 2 = 0 + 0.504 657 745 361 328 124 999 999 999 999 995 605 040 496 64;
  • 33) 0.504 657 745 361 328 124 999 999 999 999 995 605 040 496 64 × 2 = 1 + 0.009 315 490 722 656 249 999 999 999 999 991 210 080 993 28;
  • 34) 0.009 315 490 722 656 249 999 999 999 999 991 210 080 993 28 × 2 = 0 + 0.018 630 981 445 312 499 999 999 999 999 982 420 161 986 56;
  • 35) 0.018 630 981 445 312 499 999 999 999 999 982 420 161 986 56 × 2 = 0 + 0.037 261 962 890 624 999 999 999 999 999 964 840 323 973 12;
  • 36) 0.037 261 962 890 624 999 999 999 999 999 964 840 323 973 12 × 2 = 0 + 0.074 523 925 781 249 999 999 999 999 999 929 680 647 946 24;
  • 37) 0.074 523 925 781 249 999 999 999 999 999 929 680 647 946 24 × 2 = 0 + 0.149 047 851 562 499 999 999 999 999 999 859 361 295 892 48;
  • 38) 0.149 047 851 562 499 999 999 999 999 999 859 361 295 892 48 × 2 = 0 + 0.298 095 703 124 999 999 999 999 999 999 718 722 591 784 96;
  • 39) 0.298 095 703 124 999 999 999 999 999 999 718 722 591 784 96 × 2 = 0 + 0.596 191 406 249 999 999 999 999 999 999 437 445 183 569 92;
  • 40) 0.596 191 406 249 999 999 999 999 999 999 437 445 183 569 92 × 2 = 1 + 0.192 382 812 499 999 999 999 999 999 998 874 890 367 139 84;
  • 41) 0.192 382 812 499 999 999 999 999 999 998 874 890 367 139 84 × 2 = 0 + 0.384 765 624 999 999 999 999 999 999 997 749 780 734 279 68;
  • 42) 0.384 765 624 999 999 999 999 999 999 997 749 780 734 279 68 × 2 = 0 + 0.769 531 249 999 999 999 999 999 999 995 499 561 468 559 36;
  • 43) 0.769 531 249 999 999 999 999 999 999 995 499 561 468 559 36 × 2 = 1 + 0.539 062 499 999 999 999 999 999 999 990 999 122 937 118 72;
  • 44) 0.539 062 499 999 999 999 999 999 999 990 999 122 937 118 72 × 2 = 1 + 0.078 124 999 999 999 999 999 999 999 981 998 245 874 237 44;
  • 45) 0.078 124 999 999 999 999 999 999 999 981 998 245 874 237 44 × 2 = 0 + 0.156 249 999 999 999 999 999 999 999 963 996 491 748 474 88;
  • 46) 0.156 249 999 999 999 999 999 999 999 963 996 491 748 474 88 × 2 = 0 + 0.312 499 999 999 999 999 999 999 999 927 992 983 496 949 76;
  • 47) 0.312 499 999 999 999 999 999 999 999 927 992 983 496 949 76 × 2 = 0 + 0.624 999 999 999 999 999 999 999 999 855 985 966 993 899 52;
  • 48) 0.624 999 999 999 999 999 999 999 999 855 985 966 993 899 52 × 2 = 1 + 0.249 999 999 999 999 999 999 999 999 711 971 933 987 799 04;
  • 49) 0.249 999 999 999 999 999 999 999 999 711 971 933 987 799 04 × 2 = 0 + 0.499 999 999 999 999 999 999 999 999 423 943 867 975 598 08;
  • 50) 0.499 999 999 999 999 999 999 999 999 423 943 867 975 598 08 × 2 = 0 + 0.999 999 999 999 999 999 999 999 998 847 887 735 951 196 16;
  • 51) 0.999 999 999 999 999 999 999 999 998 847 887 735 951 196 16 × 2 = 1 + 0.999 999 999 999 999 999 999 999 997 695 775 471 902 392 32;
  • 52) 0.999 999 999 999 999 999 999 999 997 695 775 471 902 392 32 × 2 = 1 + 0.999 999 999 999 999 999 999 999 995 391 550 943 804 784 64;
  • 53) 0.999 999 999 999 999 999 999 999 995 391 550 943 804 784 64 × 2 = 1 + 0.999 999 999 999 999 999 999 999 990 783 101 887 609 569 28;

We didn't get any fractional part that was equal to zero. But we had enough iterations (over Mantissa limit) and at least one integer that was different from zero => FULL STOP (Losing precision - the converted number we get in the end will be just a very good approximation of the initial one).


4. Construct the base 2 representation of the fractional part of the number.

Take all the integer parts of the multiplying operations, starting from the top of the constructed list above:


0.728 822 019 999 999 959 338 765 620 486 810 803 413 390 09(10) =

0.1011 1010 1001 0100 0001 0100 0111 0100 1000 0001 0011 0001 0011 1(2)

5. Positive number before normalization:

0.728 822 019 999 999 959 338 765 620 486 810 803 413 390 09(10) =

0.1011 1010 1001 0100 0001 0100 0111 0100 1000 0001 0011 0001 0011 1(2)

6. Normalize the binary representation of the number.

Shift the decimal mark 1 positions to the right, so that only one non zero digit remains to the left of it:


0.728 822 019 999 999 959 338 765 620 486 810 803 413 390 09(10) =

0.1011 1010 1001 0100 0001 0100 0111 0100 1000 0001 0011 0001 0011 1(2) =

0.1011 1010 1001 0100 0001 0100 0111 0100 1000 0001 0011 0001 0011 1(2) × 20 =

1.0111 0101 0010 1000 0010 1000 1110 1001 0000 0010 0110 0010 0111(2) × 2-1


7. Up to this moment, there are the following elements that would feed into the 64 bit double precision IEEE 754 binary floating point representation:

Sign 0 (a positive number)

Exponent (unadjusted): -1

Mantissa (not normalized):
1.0111 0101 0010 1000 0010 1000 1110 1001 0000 0010 0110 0010 0111


8. Adjust the exponent.

Use the 11 bit excess/bias notation:


Exponent (adjusted) =

Exponent (unadjusted) + 2(11-1) - 1 =

-1 + 2(11-1) - 1 =

(-1 + 1 023)(10) =

1 022(10)


9. Convert the adjusted exponent from the decimal (base 10) to 11 bit binary.

Use the same technique of repeatedly dividing by 2:


  • division = quotient + remainder;
  • 1 022 ÷ 2 = 511 + 0;
  • 511 ÷ 2 = 255 + 1;
  • 255 ÷ 2 = 127 + 1;
  • 127 ÷ 2 = 63 + 1;
  • 63 ÷ 2 = 31 + 1;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 7 ÷ 2 = 3 + 1;
  • 3 ÷ 2 = 1 + 1;
  • 1 ÷ 2 = 0 + 1;

10. Construct the base 2 representation of the adjusted exponent.

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


Exponent (adjusted) =

1022(10) =

011 1111 1110(2)


11. Normalize the mantissa.

a) Remove the leading (the leftmost) bit, since it's allways 1, and the decimal point, if the case.

b) Adjust its length to 52 bits, only if necessary (not the case here).


Mantissa (normalized) =

1. 0111 0101 0010 1000 0010 1000 1110 1001 0000 0010 0110 0010 0111 =

0111 0101 0010 1000 0010 1000 1110 1001 0000 0010 0110 0010 0111


12. The three elements that make up the number's 64 bit double precision IEEE 754 binary floating point representation:

Sign (1 bit) =
0 (a positive number)

Exponent (11 bits) =
011 1111 1110

Mantissa (52 bits) =
0111 0101 0010 1000 0010 1000 1110 1001 0000 0010 0110 0010 0111


Decimal number 0.728 822 019 999 999 959 338 765 620 486 810 803 413 390 09 converted to 64 bit double precision IEEE 754 binary floating point representation:

0 - 011 1111 1110 - 0111 0101 0010 1000 0010 1000 1110 1001 0000 0010 0110 0010 0111

Share

» Convert decimal 0.728 822 019 999 999 959 338 765 620 486 810 803 413 389 33 to 64 bit double precision IEEE 754 binary floating point representation standard

» Calculations Performed by Our Visitors: Decimal Numbers Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard. Data organized on a Monthly Basis

» Month 07, 2026 [July]: Decimal Numbers Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard. Calculations performed during the month of: July - by our visitors

» Improve your social skills: The Hidden Requirement in Every Single Job Description. Gemini Notebook YouTube Video of 8.15 minutes

How to convert numbers from the decimal system (base ten) to 64 bit double precision IEEE 754 binary floating point standard

Follow the steps below to convert a base 10 decimal number to 64 bit double precision IEEE 754 binary floating point:

  • 1. If the number to be converted is negative, start with its the positive version.
  • 2. First convert the integer part. Divide repeatedly by 2 the positive representation of the integer number that is to be converted to binary, until we get a quotient that is equal to zero, keeping track of each remainder.
  • 3. Construct the base 2 representation of the positive integer part of the number, by taking all the remainders from the previous operations, 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. Then convert the fractional part. Multiply the number repeatedly by 2, until we get a fractional part that is equal to zero, keeping track of each integer part of the results.
  • 5. Construct the base 2 representation of the fractional part of the number, by taking all the integer parts of the multiplying operations, starting from the top of the list constructed above (they should appear in the binary representation, from left to right, in the order they have been calculated).
  • 6. Normalize the binary representation of the number, shifting the decimal mark (the decimal point) "n" positions either to the left, or to the right, so that only one non zero digit remains to the left of the decimal mark.
  • 7. Adjust the exponent in 11 bit excess/bias notation and then convert it from decimal (base 10) to 11 bit binary, by using the same technique of repeatedly dividing by 2, as shown above:
    Exponent (adjusted) = Exponent (unadjusted) + 2(11-1) - 1
  • 8. Normalize mantissa, remove the leading (leftmost) bit, since it's allways '1' (and the decimal mark, if the case) and adjust its length to 52 bits, either by removing the excess bits from the right (losing precision...) or by adding extra bits set on '0' to the right.
  • 9. Sign (it takes 1 bit) is either 1 for a negative or 0 for a positive number.

Example: convert the negative number -31.640 215 from the decimal system (base ten) to 64 bit double precision IEEE 754 binary floating point:

  • 1. Start with the positive version of the number:

    |-31.640 215| = 31.640 215

  • 2. First convert the integer part, 31. Divide it repeatedly by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
    • division = quotient + remainder;
    • 31 ÷ 2 = 15 + 1;
    • 15 ÷ 2 = 7 + 1;
    • 7 ÷ 2 = 3 + 1;
    • 3 ÷ 2 = 1 + 1;
    • 1 ÷ 2 = 0 + 1;
    • We have encountered a quotient that is ZERO => FULL STOP
  • 3. Construct the base 2 representation of the integer part of the number by taking all the remainders of the previous dividing operations, starting from the bottom of the list constructed above:

    31(10) = 1 1111(2)

  • 4. Then, convert the fractional part, 0.640 215. Multiply repeatedly by 2, keeping track of each integer part of the results, until we get a fractional part that is equal to zero:
    • #) multiplying = integer + fractional part;
    • 1) 0.640 215 × 2 = 1 + 0.280 43;
    • 2) 0.280 43 × 2 = 0 + 0.560 86;
    • 3) 0.560 86 × 2 = 1 + 0.121 72;
    • 4) 0.121 72 × 2 = 0 + 0.243 44;
    • 5) 0.243 44 × 2 = 0 + 0.486 88;
    • 6) 0.486 88 × 2 = 0 + 0.973 76;
    • 7) 0.973 76 × 2 = 1 + 0.947 52;
    • 8) 0.947 52 × 2 = 1 + 0.895 04;
    • 9) 0.895 04 × 2 = 1 + 0.790 08;
    • 10) 0.790 08 × 2 = 1 + 0.580 16;
    • 11) 0.580 16 × 2 = 1 + 0.160 32;
    • 12) 0.160 32 × 2 = 0 + 0.320 64;
    • 13) 0.320 64 × 2 = 0 + 0.641 28;
    • 14) 0.641 28 × 2 = 1 + 0.282 56;
    • 15) 0.282 56 × 2 = 0 + 0.565 12;
    • 16) 0.565 12 × 2 = 1 + 0.130 24;
    • 17) 0.130 24 × 2 = 0 + 0.260 48;
    • 18) 0.260 48 × 2 = 0 + 0.520 96;
    • 19) 0.520 96 × 2 = 1 + 0.041 92;
    • 20) 0.041 92 × 2 = 0 + 0.083 84;
    • 21) 0.083 84 × 2 = 0 + 0.167 68;
    • 22) 0.167 68 × 2 = 0 + 0.335 36;
    • 23) 0.335 36 × 2 = 0 + 0.670 72;
    • 24) 0.670 72 × 2 = 1 + 0.341 44;
    • 25) 0.341 44 × 2 = 0 + 0.682 88;
    • 26) 0.682 88 × 2 = 1 + 0.365 76;
    • 27) 0.365 76 × 2 = 0 + 0.731 52;
    • 28) 0.731 52 × 2 = 1 + 0.463 04;
    • 29) 0.463 04 × 2 = 0 + 0.926 08;
    • 30) 0.926 08 × 2 = 1 + 0.852 16;
    • 31) 0.852 16 × 2 = 1 + 0.704 32;
    • 32) 0.704 32 × 2 = 1 + 0.408 64;
    • 33) 0.408 64 × 2 = 0 + 0.817 28;
    • 34) 0.817 28 × 2 = 1 + 0.634 56;
    • 35) 0.634 56 × 2 = 1 + 0.269 12;
    • 36) 0.269 12 × 2 = 0 + 0.538 24;
    • 37) 0.538 24 × 2 = 1 + 0.076 48;
    • 38) 0.076 48 × 2 = 0 + 0.152 96;
    • 39) 0.152 96 × 2 = 0 + 0.305 92;
    • 40) 0.305 92 × 2 = 0 + 0.611 84;
    • 41) 0.611 84 × 2 = 1 + 0.223 68;
    • 42) 0.223 68 × 2 = 0 + 0.447 36;
    • 43) 0.447 36 × 2 = 0 + 0.894 72;
    • 44) 0.894 72 × 2 = 1 + 0.789 44;
    • 45) 0.789 44 × 2 = 1 + 0.578 88;
    • 46) 0.578 88 × 2 = 1 + 0.157 76;
    • 47) 0.157 76 × 2 = 0 + 0.315 52;
    • 48) 0.315 52 × 2 = 0 + 0.631 04;
    • 49) 0.631 04 × 2 = 1 + 0.262 08;
    • 50) 0.262 08 × 2 = 0 + 0.524 16;
    • 51) 0.524 16 × 2 = 1 + 0.048 32;
    • 52) 0.048 32 × 2 = 0 + 0.096 64;
    • 53) 0.096 64 × 2 = 0 + 0.193 28;
    • We didn't get any fractional part that was equal to zero. But we had enough iterations (over Mantissa limit = 52) and at least one integer part that was different from zero => FULL STOP (losing precision...).
  • 5. Construct the base 2 representation of the fractional part of the number, by taking all the integer parts of the previous multiplying operations, starting from the top of the constructed list above:

    0.640 215(10) = 0.1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0(2)

  • 6. Summarizing - the positive number before normalization:

    31.640 215(10) = 1 1111.1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0(2)

  • 7. Normalize the binary representation of the number, shifting the decimal mark 4 positions to the left so that only one non-zero digit stays to the left of the decimal mark:

    31.640 215(10) =
    1 1111.1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0(2) =
    1 1111.1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0(2) × 20 =
    1.1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0(2) × 24

  • 8. Up to this moment, there are the following elements that would feed into the 64 bit double precision IEEE 754 binary floating point representation:

    Sign: 1 (a negative number)

    Exponent (unadjusted): 4

    Mantissa (not-normalized): 1.1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0

  • 9. Adjust the exponent in 11 bit excess/bias notation and then convert it from decimal (base 10) to 11 bit binary (base 2), by using the same technique of repeatedly dividing it by 2, as shown above:

    Exponent (adjusted) = Exponent (unadjusted) + 2(11-1) - 1 = (4 + 1023)(10) = 1027(10) =
    100 0000 0011(2)

  • 10. Normalize mantissa, remove the leading (leftmost) bit, since it's allways '1' (and the decimal sign) and adjust its length to 52 bits, by removing the excess bits, from the right (losing precision...):

    Mantissa (not-normalized): 1.1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0

    Mantissa (normalized): 1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100

  • Conclusion:

    Sign (1 bit) = 1 (a negative number)

    Exponent (8 bits) = 100 0000 0011

    Mantissa (52 bits) = 1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100

  • Number -31.640 215, converted from decimal system (base 10) to 64 bit double precision IEEE 754 binary floating point =
    1 - 100 0000 0011 - 1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100