0.000 244 140 620 999 999 988 878 156 886 862 312 07 Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal 0.000 244 140 620 999 999 988 878 156 886 862 312 07(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.000 244 140 620 999 999 988 878 156 886 862 312 07(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.000 244 140 620 999 999 988 878 156 886 862 312 07.

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.000 244 140 620 999 999 988 878 156 886 862 312 07 × 2 = 0 + 0.000 488 281 241 999 999 977 756 313 773 724 624 14;
  • 2) 0.000 488 281 241 999 999 977 756 313 773 724 624 14 × 2 = 0 + 0.000 976 562 483 999 999 955 512 627 547 449 248 28;
  • 3) 0.000 976 562 483 999 999 955 512 627 547 449 248 28 × 2 = 0 + 0.001 953 124 967 999 999 911 025 255 094 898 496 56;
  • 4) 0.001 953 124 967 999 999 911 025 255 094 898 496 56 × 2 = 0 + 0.003 906 249 935 999 999 822 050 510 189 796 993 12;
  • 5) 0.003 906 249 935 999 999 822 050 510 189 796 993 12 × 2 = 0 + 0.007 812 499 871 999 999 644 101 020 379 593 986 24;
  • 6) 0.007 812 499 871 999 999 644 101 020 379 593 986 24 × 2 = 0 + 0.015 624 999 743 999 999 288 202 040 759 187 972 48;
  • 7) 0.015 624 999 743 999 999 288 202 040 759 187 972 48 × 2 = 0 + 0.031 249 999 487 999 998 576 404 081 518 375 944 96;
  • 8) 0.031 249 999 487 999 998 576 404 081 518 375 944 96 × 2 = 0 + 0.062 499 998 975 999 997 152 808 163 036 751 889 92;
  • 9) 0.062 499 998 975 999 997 152 808 163 036 751 889 92 × 2 = 0 + 0.124 999 997 951 999 994 305 616 326 073 503 779 84;
  • 10) 0.124 999 997 951 999 994 305 616 326 073 503 779 84 × 2 = 0 + 0.249 999 995 903 999 988 611 232 652 147 007 559 68;
  • 11) 0.249 999 995 903 999 988 611 232 652 147 007 559 68 × 2 = 0 + 0.499 999 991 807 999 977 222 465 304 294 015 119 36;
  • 12) 0.499 999 991 807 999 977 222 465 304 294 015 119 36 × 2 = 0 + 0.999 999 983 615 999 954 444 930 608 588 030 238 72;
  • 13) 0.999 999 983 615 999 954 444 930 608 588 030 238 72 × 2 = 1 + 0.999 999 967 231 999 908 889 861 217 176 060 477 44;
  • 14) 0.999 999 967 231 999 908 889 861 217 176 060 477 44 × 2 = 1 + 0.999 999 934 463 999 817 779 722 434 352 120 954 88;
  • 15) 0.999 999 934 463 999 817 779 722 434 352 120 954 88 × 2 = 1 + 0.999 999 868 927 999 635 559 444 868 704 241 909 76;
  • 16) 0.999 999 868 927 999 635 559 444 868 704 241 909 76 × 2 = 1 + 0.999 999 737 855 999 271 118 889 737 408 483 819 52;
  • 17) 0.999 999 737 855 999 271 118 889 737 408 483 819 52 × 2 = 1 + 0.999 999 475 711 998 542 237 779 474 816 967 639 04;
  • 18) 0.999 999 475 711 998 542 237 779 474 816 967 639 04 × 2 = 1 + 0.999 998 951 423 997 084 475 558 949 633 935 278 08;
  • 19) 0.999 998 951 423 997 084 475 558 949 633 935 278 08 × 2 = 1 + 0.999 997 902 847 994 168 951 117 899 267 870 556 16;
  • 20) 0.999 997 902 847 994 168 951 117 899 267 870 556 16 × 2 = 1 + 0.999 995 805 695 988 337 902 235 798 535 741 112 32;
  • 21) 0.999 995 805 695 988 337 902 235 798 535 741 112 32 × 2 = 1 + 0.999 991 611 391 976 675 804 471 597 071 482 224 64;
  • 22) 0.999 991 611 391 976 675 804 471 597 071 482 224 64 × 2 = 1 + 0.999 983 222 783 953 351 608 943 194 142 964 449 28;
  • 23) 0.999 983 222 783 953 351 608 943 194 142 964 449 28 × 2 = 1 + 0.999 966 445 567 906 703 217 886 388 285 928 898 56;
  • 24) 0.999 966 445 567 906 703 217 886 388 285 928 898 56 × 2 = 1 + 0.999 932 891 135 813 406 435 772 776 571 857 797 12;
  • 25) 0.999 932 891 135 813 406 435 772 776 571 857 797 12 × 2 = 1 + 0.999 865 782 271 626 812 871 545 553 143 715 594 24;
  • 26) 0.999 865 782 271 626 812 871 545 553 143 715 594 24 × 2 = 1 + 0.999 731 564 543 253 625 743 091 106 287 431 188 48;
  • 27) 0.999 731 564 543 253 625 743 091 106 287 431 188 48 × 2 = 1 + 0.999 463 129 086 507 251 486 182 212 574 862 376 96;
  • 28) 0.999 463 129 086 507 251 486 182 212 574 862 376 96 × 2 = 1 + 0.998 926 258 173 014 502 972 364 425 149 724 753 92;
  • 29) 0.998 926 258 173 014 502 972 364 425 149 724 753 92 × 2 = 1 + 0.997 852 516 346 029 005 944 728 850 299 449 507 84;
  • 30) 0.997 852 516 346 029 005 944 728 850 299 449 507 84 × 2 = 1 + 0.995 705 032 692 058 011 889 457 700 598 899 015 68;
  • 31) 0.995 705 032 692 058 011 889 457 700 598 899 015 68 × 2 = 1 + 0.991 410 065 384 116 023 778 915 401 197 798 031 36;
  • 32) 0.991 410 065 384 116 023 778 915 401 197 798 031 36 × 2 = 1 + 0.982 820 130 768 232 047 557 830 802 395 596 062 72;
  • 33) 0.982 820 130 768 232 047 557 830 802 395 596 062 72 × 2 = 1 + 0.965 640 261 536 464 095 115 661 604 791 192 125 44;
  • 34) 0.965 640 261 536 464 095 115 661 604 791 192 125 44 × 2 = 1 + 0.931 280 523 072 928 190 231 323 209 582 384 250 88;
  • 35) 0.931 280 523 072 928 190 231 323 209 582 384 250 88 × 2 = 1 + 0.862 561 046 145 856 380 462 646 419 164 768 501 76;
  • 36) 0.862 561 046 145 856 380 462 646 419 164 768 501 76 × 2 = 1 + 0.725 122 092 291 712 760 925 292 838 329 537 003 52;
  • 37) 0.725 122 092 291 712 760 925 292 838 329 537 003 52 × 2 = 1 + 0.450 244 184 583 425 521 850 585 676 659 074 007 04;
  • 38) 0.450 244 184 583 425 521 850 585 676 659 074 007 04 × 2 = 0 + 0.900 488 369 166 851 043 701 171 353 318 148 014 08;
  • 39) 0.900 488 369 166 851 043 701 171 353 318 148 014 08 × 2 = 1 + 0.800 976 738 333 702 087 402 342 706 636 296 028 16;
  • 40) 0.800 976 738 333 702 087 402 342 706 636 296 028 16 × 2 = 1 + 0.601 953 476 667 404 174 804 685 413 272 592 056 32;
  • 41) 0.601 953 476 667 404 174 804 685 413 272 592 056 32 × 2 = 1 + 0.203 906 953 334 808 349 609 370 826 545 184 112 64;
  • 42) 0.203 906 953 334 808 349 609 370 826 545 184 112 64 × 2 = 0 + 0.407 813 906 669 616 699 218 741 653 090 368 225 28;
  • 43) 0.407 813 906 669 616 699 218 741 653 090 368 225 28 × 2 = 0 + 0.815 627 813 339 233 398 437 483 306 180 736 450 56;
  • 44) 0.815 627 813 339 233 398 437 483 306 180 736 450 56 × 2 = 1 + 0.631 255 626 678 466 796 874 966 612 361 472 901 12;
  • 45) 0.631 255 626 678 466 796 874 966 612 361 472 901 12 × 2 = 1 + 0.262 511 253 356 933 593 749 933 224 722 945 802 24;
  • 46) 0.262 511 253 356 933 593 749 933 224 722 945 802 24 × 2 = 0 + 0.525 022 506 713 867 187 499 866 449 445 891 604 48;
  • 47) 0.525 022 506 713 867 187 499 866 449 445 891 604 48 × 2 = 1 + 0.050 045 013 427 734 374 999 732 898 891 783 208 96;
  • 48) 0.050 045 013 427 734 374 999 732 898 891 783 208 96 × 2 = 0 + 0.100 090 026 855 468 749 999 465 797 783 566 417 92;
  • 49) 0.100 090 026 855 468 749 999 465 797 783 566 417 92 × 2 = 0 + 0.200 180 053 710 937 499 998 931 595 567 132 835 84;
  • 50) 0.200 180 053 710 937 499 998 931 595 567 132 835 84 × 2 = 0 + 0.400 360 107 421 874 999 997 863 191 134 265 671 68;
  • 51) 0.400 360 107 421 874 999 997 863 191 134 265 671 68 × 2 = 0 + 0.800 720 214 843 749 999 995 726 382 268 531 343 36;
  • 52) 0.800 720 214 843 749 999 995 726 382 268 531 343 36 × 2 = 1 + 0.601 440 429 687 499 999 991 452 764 537 062 686 72;
  • 53) 0.601 440 429 687 499 999 991 452 764 537 062 686 72 × 2 = 1 + 0.202 880 859 374 999 999 982 905 529 074 125 373 44;
  • 54) 0.202 880 859 374 999 999 982 905 529 074 125 373 44 × 2 = 0 + 0.405 761 718 749 999 999 965 811 058 148 250 746 88;
  • 55) 0.405 761 718 749 999 999 965 811 058 148 250 746 88 × 2 = 0 + 0.811 523 437 499 999 999 931 622 116 296 501 493 76;
  • 56) 0.811 523 437 499 999 999 931 622 116 296 501 493 76 × 2 = 1 + 0.623 046 874 999 999 999 863 244 232 593 002 987 52;
  • 57) 0.623 046 874 999 999 999 863 244 232 593 002 987 52 × 2 = 1 + 0.246 093 749 999 999 999 726 488 465 186 005 975 04;
  • 58) 0.246 093 749 999 999 999 726 488 465 186 005 975 04 × 2 = 0 + 0.492 187 499 999 999 999 452 976 930 372 011 950 08;
  • 59) 0.492 187 499 999 999 999 452 976 930 372 011 950 08 × 2 = 0 + 0.984 374 999 999 999 998 905 953 860 744 023 900 16;
  • 60) 0.984 374 999 999 999 998 905 953 860 744 023 900 16 × 2 = 1 + 0.968 749 999 999 999 997 811 907 721 488 047 800 32;
  • 61) 0.968 749 999 999 999 997 811 907 721 488 047 800 32 × 2 = 1 + 0.937 499 999 999 999 995 623 815 442 976 095 600 64;
  • 62) 0.937 499 999 999 999 995 623 815 442 976 095 600 64 × 2 = 1 + 0.874 999 999 999 999 991 247 630 885 952 191 201 28;
  • 63) 0.874 999 999 999 999 991 247 630 885 952 191 201 28 × 2 = 1 + 0.749 999 999 999 999 982 495 261 771 904 382 402 56;
  • 64) 0.749 999 999 999 999 982 495 261 771 904 382 402 56 × 2 = 1 + 0.499 999 999 999 999 964 990 523 543 808 764 805 12;
  • 65) 0.499 999 999 999 999 964 990 523 543 808 764 805 12 × 2 = 0 + 0.999 999 999 999 999 929 981 047 087 617 529 610 24;

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.000 244 140 620 999 999 988 878 156 886 862 312 07(10) =

0.0000 0000 0000 1111 1111 1111 1111 1111 1111 1011 1001 1010 0001 1001 1001 1111 0(2)

5. Positive number before normalization:

0.000 244 140 620 999 999 988 878 156 886 862 312 07(10) =

0.0000 0000 0000 1111 1111 1111 1111 1111 1111 1011 1001 1010 0001 1001 1001 1111 0(2)

6. Normalize the binary representation of the number.

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


0.000 244 140 620 999 999 988 878 156 886 862 312 07(10) =

0.0000 0000 0000 1111 1111 1111 1111 1111 1111 1011 1001 1010 0001 1001 1001 1111 0(2) =

0.0000 0000 0000 1111 1111 1111 1111 1111 1111 1011 1001 1010 0001 1001 1001 1111 0(2) × 20 =

1.1111 1111 1111 1111 1111 1111 0111 0011 0100 0011 0011 0011 1110(2) × 2-13


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): -13

Mantissa (not normalized):
1.1111 1111 1111 1111 1111 1111 0111 0011 0100 0011 0011 0011 1110


8. Adjust the exponent.

Use the 11 bit excess/bias notation:


Exponent (adjusted) =

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

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

(-13 + 1 023)(10) =

1 010(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 010 ÷ 2 = 505 + 0;
  • 505 ÷ 2 = 252 + 1;
  • 252 ÷ 2 = 126 + 0;
  • 126 ÷ 2 = 63 + 0;
  • 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) =

1010(10) =

011 1111 0010(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. 1111 1111 1111 1111 1111 1111 0111 0011 0100 0011 0011 0011 1110 =

1111 1111 1111 1111 1111 1111 0111 0011 0100 0011 0011 0011 1110


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 0010

Mantissa (52 bits) =
1111 1111 1111 1111 1111 1111 0111 0011 0100 0011 0011 0011 1110


Decimal number 0.000 244 140 620 999 999 988 878 156 886 862 312 07 converted to 64 bit double precision IEEE 754 binary floating point representation:

0 - 011 1111 0010 - 1111 1111 1111 1111 1111 1111 0111 0011 0100 0011 0011 0011 1110

Share

» Convert decimal 0.000 244 140 620 999 999 988 878 156 886 862 311 77 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 09, 2026 [September]: Decimal Numbers Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard. Calculations performed during the month of: September - by our visitors

» Improve your social skills: The Attention Economy - The Battlefield For Your Focus. Gemini Notebook YouTube Video of 7.50 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