2.718 281 828 459 045 235 360 287 471 352 662 497 757 247 093 693 41 Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal 2.718 281 828 459 045 235 360 287 471 352 662 497 757 247 093 693 41(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
2.718 281 828 459 045 235 360 287 471 352 662 497 757 247 093 693 41(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: 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;
  • 2 ÷ 2 = 1 + 0;
  • 1 ÷ 2 = 0 + 1;

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.

2(10) =

10(2)


3. Convert to binary (base 2) the fractional part: 0.718 281 828 459 045 235 360 287 471 352 662 497 757 247 093 693 41.

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.718 281 828 459 045 235 360 287 471 352 662 497 757 247 093 693 41 × 2 = 1 + 0.436 563 656 918 090 470 720 574 942 705 324 995 514 494 187 386 82;
  • 2) 0.436 563 656 918 090 470 720 574 942 705 324 995 514 494 187 386 82 × 2 = 0 + 0.873 127 313 836 180 941 441 149 885 410 649 991 028 988 374 773 64;
  • 3) 0.873 127 313 836 180 941 441 149 885 410 649 991 028 988 374 773 64 × 2 = 1 + 0.746 254 627 672 361 882 882 299 770 821 299 982 057 976 749 547 28;
  • 4) 0.746 254 627 672 361 882 882 299 770 821 299 982 057 976 749 547 28 × 2 = 1 + 0.492 509 255 344 723 765 764 599 541 642 599 964 115 953 499 094 56;
  • 5) 0.492 509 255 344 723 765 764 599 541 642 599 964 115 953 499 094 56 × 2 = 0 + 0.985 018 510 689 447 531 529 199 083 285 199 928 231 906 998 189 12;
  • 6) 0.985 018 510 689 447 531 529 199 083 285 199 928 231 906 998 189 12 × 2 = 1 + 0.970 037 021 378 895 063 058 398 166 570 399 856 463 813 996 378 24;
  • 7) 0.970 037 021 378 895 063 058 398 166 570 399 856 463 813 996 378 24 × 2 = 1 + 0.940 074 042 757 790 126 116 796 333 140 799 712 927 627 992 756 48;
  • 8) 0.940 074 042 757 790 126 116 796 333 140 799 712 927 627 992 756 48 × 2 = 1 + 0.880 148 085 515 580 252 233 592 666 281 599 425 855 255 985 512 96;
  • 9) 0.880 148 085 515 580 252 233 592 666 281 599 425 855 255 985 512 96 × 2 = 1 + 0.760 296 171 031 160 504 467 185 332 563 198 851 710 511 971 025 92;
  • 10) 0.760 296 171 031 160 504 467 185 332 563 198 851 710 511 971 025 92 × 2 = 1 + 0.520 592 342 062 321 008 934 370 665 126 397 703 421 023 942 051 84;
  • 11) 0.520 592 342 062 321 008 934 370 665 126 397 703 421 023 942 051 84 × 2 = 1 + 0.041 184 684 124 642 017 868 741 330 252 795 406 842 047 884 103 68;
  • 12) 0.041 184 684 124 642 017 868 741 330 252 795 406 842 047 884 103 68 × 2 = 0 + 0.082 369 368 249 284 035 737 482 660 505 590 813 684 095 768 207 36;
  • 13) 0.082 369 368 249 284 035 737 482 660 505 590 813 684 095 768 207 36 × 2 = 0 + 0.164 738 736 498 568 071 474 965 321 011 181 627 368 191 536 414 72;
  • 14) 0.164 738 736 498 568 071 474 965 321 011 181 627 368 191 536 414 72 × 2 = 0 + 0.329 477 472 997 136 142 949 930 642 022 363 254 736 383 072 829 44;
  • 15) 0.329 477 472 997 136 142 949 930 642 022 363 254 736 383 072 829 44 × 2 = 0 + 0.658 954 945 994 272 285 899 861 284 044 726 509 472 766 145 658 88;
  • 16) 0.658 954 945 994 272 285 899 861 284 044 726 509 472 766 145 658 88 × 2 = 1 + 0.317 909 891 988 544 571 799 722 568 089 453 018 945 532 291 317 76;
  • 17) 0.317 909 891 988 544 571 799 722 568 089 453 018 945 532 291 317 76 × 2 = 0 + 0.635 819 783 977 089 143 599 445 136 178 906 037 891 064 582 635 52;
  • 18) 0.635 819 783 977 089 143 599 445 136 178 906 037 891 064 582 635 52 × 2 = 1 + 0.271 639 567 954 178 287 198 890 272 357 812 075 782 129 165 271 04;
  • 19) 0.271 639 567 954 178 287 198 890 272 357 812 075 782 129 165 271 04 × 2 = 0 + 0.543 279 135 908 356 574 397 780 544 715 624 151 564 258 330 542 08;
  • 20) 0.543 279 135 908 356 574 397 780 544 715 624 151 564 258 330 542 08 × 2 = 1 + 0.086 558 271 816 713 148 795 561 089 431 248 303 128 516 661 084 16;
  • 21) 0.086 558 271 816 713 148 795 561 089 431 248 303 128 516 661 084 16 × 2 = 0 + 0.173 116 543 633 426 297 591 122 178 862 496 606 257 033 322 168 32;
  • 22) 0.173 116 543 633 426 297 591 122 178 862 496 606 257 033 322 168 32 × 2 = 0 + 0.346 233 087 266 852 595 182 244 357 724 993 212 514 066 644 336 64;
  • 23) 0.346 233 087 266 852 595 182 244 357 724 993 212 514 066 644 336 64 × 2 = 0 + 0.692 466 174 533 705 190 364 488 715 449 986 425 028 133 288 673 28;
  • 24) 0.692 466 174 533 705 190 364 488 715 449 986 425 028 133 288 673 28 × 2 = 1 + 0.384 932 349 067 410 380 728 977 430 899 972 850 056 266 577 346 56;
  • 25) 0.384 932 349 067 410 380 728 977 430 899 972 850 056 266 577 346 56 × 2 = 0 + 0.769 864 698 134 820 761 457 954 861 799 945 700 112 533 154 693 12;
  • 26) 0.769 864 698 134 820 761 457 954 861 799 945 700 112 533 154 693 12 × 2 = 1 + 0.539 729 396 269 641 522 915 909 723 599 891 400 225 066 309 386 24;
  • 27) 0.539 729 396 269 641 522 915 909 723 599 891 400 225 066 309 386 24 × 2 = 1 + 0.079 458 792 539 283 045 831 819 447 199 782 800 450 132 618 772 48;
  • 28) 0.079 458 792 539 283 045 831 819 447 199 782 800 450 132 618 772 48 × 2 = 0 + 0.158 917 585 078 566 091 663 638 894 399 565 600 900 265 237 544 96;
  • 29) 0.158 917 585 078 566 091 663 638 894 399 565 600 900 265 237 544 96 × 2 = 0 + 0.317 835 170 157 132 183 327 277 788 799 131 201 800 530 475 089 92;
  • 30) 0.317 835 170 157 132 183 327 277 788 799 131 201 800 530 475 089 92 × 2 = 0 + 0.635 670 340 314 264 366 654 555 577 598 262 403 601 060 950 179 84;
  • 31) 0.635 670 340 314 264 366 654 555 577 598 262 403 601 060 950 179 84 × 2 = 1 + 0.271 340 680 628 528 733 309 111 155 196 524 807 202 121 900 359 68;
  • 32) 0.271 340 680 628 528 733 309 111 155 196 524 807 202 121 900 359 68 × 2 = 0 + 0.542 681 361 257 057 466 618 222 310 393 049 614 404 243 800 719 36;
  • 33) 0.542 681 361 257 057 466 618 222 310 393 049 614 404 243 800 719 36 × 2 = 1 + 0.085 362 722 514 114 933 236 444 620 786 099 228 808 487 601 438 72;
  • 34) 0.085 362 722 514 114 933 236 444 620 786 099 228 808 487 601 438 72 × 2 = 0 + 0.170 725 445 028 229 866 472 889 241 572 198 457 616 975 202 877 44;
  • 35) 0.170 725 445 028 229 866 472 889 241 572 198 457 616 975 202 877 44 × 2 = 0 + 0.341 450 890 056 459 732 945 778 483 144 396 915 233 950 405 754 88;
  • 36) 0.341 450 890 056 459 732 945 778 483 144 396 915 233 950 405 754 88 × 2 = 0 + 0.682 901 780 112 919 465 891 556 966 288 793 830 467 900 811 509 76;
  • 37) 0.682 901 780 112 919 465 891 556 966 288 793 830 467 900 811 509 76 × 2 = 1 + 0.365 803 560 225 838 931 783 113 932 577 587 660 935 801 623 019 52;
  • 38) 0.365 803 560 225 838 931 783 113 932 577 587 660 935 801 623 019 52 × 2 = 0 + 0.731 607 120 451 677 863 566 227 865 155 175 321 871 603 246 039 04;
  • 39) 0.731 607 120 451 677 863 566 227 865 155 175 321 871 603 246 039 04 × 2 = 1 + 0.463 214 240 903 355 727 132 455 730 310 350 643 743 206 492 078 08;
  • 40) 0.463 214 240 903 355 727 132 455 730 310 350 643 743 206 492 078 08 × 2 = 0 + 0.926 428 481 806 711 454 264 911 460 620 701 287 486 412 984 156 16;
  • 41) 0.926 428 481 806 711 454 264 911 460 620 701 287 486 412 984 156 16 × 2 = 1 + 0.852 856 963 613 422 908 529 822 921 241 402 574 972 825 968 312 32;
  • 42) 0.852 856 963 613 422 908 529 822 921 241 402 574 972 825 968 312 32 × 2 = 1 + 0.705 713 927 226 845 817 059 645 842 482 805 149 945 651 936 624 64;
  • 43) 0.705 713 927 226 845 817 059 645 842 482 805 149 945 651 936 624 64 × 2 = 1 + 0.411 427 854 453 691 634 119 291 684 965 610 299 891 303 873 249 28;
  • 44) 0.411 427 854 453 691 634 119 291 684 965 610 299 891 303 873 249 28 × 2 = 0 + 0.822 855 708 907 383 268 238 583 369 931 220 599 782 607 746 498 56;
  • 45) 0.822 855 708 907 383 268 238 583 369 931 220 599 782 607 746 498 56 × 2 = 1 + 0.645 711 417 814 766 536 477 166 739 862 441 199 565 215 492 997 12;
  • 46) 0.645 711 417 814 766 536 477 166 739 862 441 199 565 215 492 997 12 × 2 = 1 + 0.291 422 835 629 533 072 954 333 479 724 882 399 130 430 985 994 24;
  • 47) 0.291 422 835 629 533 072 954 333 479 724 882 399 130 430 985 994 24 × 2 = 0 + 0.582 845 671 259 066 145 908 666 959 449 764 798 260 861 971 988 48;
  • 48) 0.582 845 671 259 066 145 908 666 959 449 764 798 260 861 971 988 48 × 2 = 1 + 0.165 691 342 518 132 291 817 333 918 899 529 596 521 723 943 976 96;
  • 49) 0.165 691 342 518 132 291 817 333 918 899 529 596 521 723 943 976 96 × 2 = 0 + 0.331 382 685 036 264 583 634 667 837 799 059 193 043 447 887 953 92;
  • 50) 0.331 382 685 036 264 583 634 667 837 799 059 193 043 447 887 953 92 × 2 = 0 + 0.662 765 370 072 529 167 269 335 675 598 118 386 086 895 775 907 84;
  • 51) 0.662 765 370 072 529 167 269 335 675 598 118 386 086 895 775 907 84 × 2 = 1 + 0.325 530 740 145 058 334 538 671 351 196 236 772 173 791 551 815 68;
  • 52) 0.325 530 740 145 058 334 538 671 351 196 236 772 173 791 551 815 68 × 2 = 0 + 0.651 061 480 290 116 669 077 342 702 392 473 544 347 583 103 631 36;
  • 53) 0.651 061 480 290 116 669 077 342 702 392 473 544 347 583 103 631 36 × 2 = 1 + 0.302 122 960 580 233 338 154 685 404 784 947 088 695 166 207 262 72;

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.718 281 828 459 045 235 360 287 471 352 662 497 757 247 093 693 41(10) =

0.1011 0111 1110 0001 0101 0001 0110 0010 1000 1010 1110 1101 0010 1(2)

5. Positive number before normalization:

2.718 281 828 459 045 235 360 287 471 352 662 497 757 247 093 693 41(10) =

10.1011 0111 1110 0001 0101 0001 0110 0010 1000 1010 1110 1101 0010 1(2)

6. Normalize the binary representation of the number.

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


2.718 281 828 459 045 235 360 287 471 352 662 497 757 247 093 693 41(10) =

10.1011 0111 1110 0001 0101 0001 0110 0010 1000 1010 1110 1101 0010 1(2) =

10.1011 0111 1110 0001 0101 0001 0110 0010 1000 1010 1110 1101 0010 1(2) × 20 =

1.0101 1011 1111 0000 1010 1000 1011 0001 0100 0101 0111 0110 1001 01(2) × 21


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.0101 1011 1111 0000 1010 1000 1011 0001 0100 0101 0111 0110 1001 01


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 024(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 024 ÷ 2 = 512 + 0;
  • 512 ÷ 2 = 256 + 0;
  • 256 ÷ 2 = 128 + 0;
  • 128 ÷ 2 = 64 + 0;
  • 64 ÷ 2 = 32 + 0;
  • 32 ÷ 2 = 16 + 0;
  • 16 ÷ 2 = 8 + 0;
  • 8 ÷ 2 = 4 + 0;
  • 4 ÷ 2 = 2 + 0;
  • 2 ÷ 2 = 1 + 0;
  • 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) =

1024(10) =

100 0000 0000(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, by removing the excess bits, from the right (if any of the excess bits is set on 1, we are losing precision...).


Mantissa (normalized) =

1. 0101 1011 1111 0000 1010 1000 1011 0001 0100 0101 0111 0110 1001 01 =

0101 1011 1111 0000 1010 1000 1011 0001 0100 0101 0111 0110 1001


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) =
100 0000 0000

Mantissa (52 bits) =
0101 1011 1111 0000 1010 1000 1011 0001 0100 0101 0111 0110 1001


Decimal number 2.718 281 828 459 045 235 360 287 471 352 662 497 757 247 093 693 41 converted to 64 bit double precision IEEE 754 binary floating point representation:

0 - 100 0000 0000 - 0101 1011 1111 0000 1010 1000 1011 0001 0100 0101 0111 0110 1001

Share

» Convert decimal 2.718 281 828 459 045 235 360 287 471 352 662 497 757 247 093 692 56 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 04, 2026 [April]: Decimal Numbers Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard. Calculations performed during the month of: April - 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 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