0.000 000 000 000 000 000 261 Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal 0.000 000 000 000 000 000 261(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 000 000 000 000 000 261(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 000 000 000 000 000 261.

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 000 000 000 000 000 261 × 2 = 0 + 0.000 000 000 000 000 000 522;
  • 2) 0.000 000 000 000 000 000 522 × 2 = 0 + 0.000 000 000 000 000 001 044;
  • 3) 0.000 000 000 000 000 001 044 × 2 = 0 + 0.000 000 000 000 000 002 088;
  • 4) 0.000 000 000 000 000 002 088 × 2 = 0 + 0.000 000 000 000 000 004 176;
  • 5) 0.000 000 000 000 000 004 176 × 2 = 0 + 0.000 000 000 000 000 008 352;
  • 6) 0.000 000 000 000 000 008 352 × 2 = 0 + 0.000 000 000 000 000 016 704;
  • 7) 0.000 000 000 000 000 016 704 × 2 = 0 + 0.000 000 000 000 000 033 408;
  • 8) 0.000 000 000 000 000 033 408 × 2 = 0 + 0.000 000 000 000 000 066 816;
  • 9) 0.000 000 000 000 000 066 816 × 2 = 0 + 0.000 000 000 000 000 133 632;
  • 10) 0.000 000 000 000 000 133 632 × 2 = 0 + 0.000 000 000 000 000 267 264;
  • 11) 0.000 000 000 000 000 267 264 × 2 = 0 + 0.000 000 000 000 000 534 528;
  • 12) 0.000 000 000 000 000 534 528 × 2 = 0 + 0.000 000 000 000 001 069 056;
  • 13) 0.000 000 000 000 001 069 056 × 2 = 0 + 0.000 000 000 000 002 138 112;
  • 14) 0.000 000 000 000 002 138 112 × 2 = 0 + 0.000 000 000 000 004 276 224;
  • 15) 0.000 000 000 000 004 276 224 × 2 = 0 + 0.000 000 000 000 008 552 448;
  • 16) 0.000 000 000 000 008 552 448 × 2 = 0 + 0.000 000 000 000 017 104 896;
  • 17) 0.000 000 000 000 017 104 896 × 2 = 0 + 0.000 000 000 000 034 209 792;
  • 18) 0.000 000 000 000 034 209 792 × 2 = 0 + 0.000 000 000 000 068 419 584;
  • 19) 0.000 000 000 000 068 419 584 × 2 = 0 + 0.000 000 000 000 136 839 168;
  • 20) 0.000 000 000 000 136 839 168 × 2 = 0 + 0.000 000 000 000 273 678 336;
  • 21) 0.000 000 000 000 273 678 336 × 2 = 0 + 0.000 000 000 000 547 356 672;
  • 22) 0.000 000 000 000 547 356 672 × 2 = 0 + 0.000 000 000 001 094 713 344;
  • 23) 0.000 000 000 001 094 713 344 × 2 = 0 + 0.000 000 000 002 189 426 688;
  • 24) 0.000 000 000 002 189 426 688 × 2 = 0 + 0.000 000 000 004 378 853 376;
  • 25) 0.000 000 000 004 378 853 376 × 2 = 0 + 0.000 000 000 008 757 706 752;
  • 26) 0.000 000 000 008 757 706 752 × 2 = 0 + 0.000 000 000 017 515 413 504;
  • 27) 0.000 000 000 017 515 413 504 × 2 = 0 + 0.000 000 000 035 030 827 008;
  • 28) 0.000 000 000 035 030 827 008 × 2 = 0 + 0.000 000 000 070 061 654 016;
  • 29) 0.000 000 000 070 061 654 016 × 2 = 0 + 0.000 000 000 140 123 308 032;
  • 30) 0.000 000 000 140 123 308 032 × 2 = 0 + 0.000 000 000 280 246 616 064;
  • 31) 0.000 000 000 280 246 616 064 × 2 = 0 + 0.000 000 000 560 493 232 128;
  • 32) 0.000 000 000 560 493 232 128 × 2 = 0 + 0.000 000 001 120 986 464 256;
  • 33) 0.000 000 001 120 986 464 256 × 2 = 0 + 0.000 000 002 241 972 928 512;
  • 34) 0.000 000 002 241 972 928 512 × 2 = 0 + 0.000 000 004 483 945 857 024;
  • 35) 0.000 000 004 483 945 857 024 × 2 = 0 + 0.000 000 008 967 891 714 048;
  • 36) 0.000 000 008 967 891 714 048 × 2 = 0 + 0.000 000 017 935 783 428 096;
  • 37) 0.000 000 017 935 783 428 096 × 2 = 0 + 0.000 000 035 871 566 856 192;
  • 38) 0.000 000 035 871 566 856 192 × 2 = 0 + 0.000 000 071 743 133 712 384;
  • 39) 0.000 000 071 743 133 712 384 × 2 = 0 + 0.000 000 143 486 267 424 768;
  • 40) 0.000 000 143 486 267 424 768 × 2 = 0 + 0.000 000 286 972 534 849 536;
  • 41) 0.000 000 286 972 534 849 536 × 2 = 0 + 0.000 000 573 945 069 699 072;
  • 42) 0.000 000 573 945 069 699 072 × 2 = 0 + 0.000 001 147 890 139 398 144;
  • 43) 0.000 001 147 890 139 398 144 × 2 = 0 + 0.000 002 295 780 278 796 288;
  • 44) 0.000 002 295 780 278 796 288 × 2 = 0 + 0.000 004 591 560 557 592 576;
  • 45) 0.000 004 591 560 557 592 576 × 2 = 0 + 0.000 009 183 121 115 185 152;
  • 46) 0.000 009 183 121 115 185 152 × 2 = 0 + 0.000 018 366 242 230 370 304;
  • 47) 0.000 018 366 242 230 370 304 × 2 = 0 + 0.000 036 732 484 460 740 608;
  • 48) 0.000 036 732 484 460 740 608 × 2 = 0 + 0.000 073 464 968 921 481 216;
  • 49) 0.000 073 464 968 921 481 216 × 2 = 0 + 0.000 146 929 937 842 962 432;
  • 50) 0.000 146 929 937 842 962 432 × 2 = 0 + 0.000 293 859 875 685 924 864;
  • 51) 0.000 293 859 875 685 924 864 × 2 = 0 + 0.000 587 719 751 371 849 728;
  • 52) 0.000 587 719 751 371 849 728 × 2 = 0 + 0.001 175 439 502 743 699 456;
  • 53) 0.001 175 439 502 743 699 456 × 2 = 0 + 0.002 350 879 005 487 398 912;
  • 54) 0.002 350 879 005 487 398 912 × 2 = 0 + 0.004 701 758 010 974 797 824;
  • 55) 0.004 701 758 010 974 797 824 × 2 = 0 + 0.009 403 516 021 949 595 648;
  • 56) 0.009 403 516 021 949 595 648 × 2 = 0 + 0.018 807 032 043 899 191 296;
  • 57) 0.018 807 032 043 899 191 296 × 2 = 0 + 0.037 614 064 087 798 382 592;
  • 58) 0.037 614 064 087 798 382 592 × 2 = 0 + 0.075 228 128 175 596 765 184;
  • 59) 0.075 228 128 175 596 765 184 × 2 = 0 + 0.150 456 256 351 193 530 368;
  • 60) 0.150 456 256 351 193 530 368 × 2 = 0 + 0.300 912 512 702 387 060 736;
  • 61) 0.300 912 512 702 387 060 736 × 2 = 0 + 0.601 825 025 404 774 121 472;
  • 62) 0.601 825 025 404 774 121 472 × 2 = 1 + 0.203 650 050 809 548 242 944;
  • 63) 0.203 650 050 809 548 242 944 × 2 = 0 + 0.407 300 101 619 096 485 888;
  • 64) 0.407 300 101 619 096 485 888 × 2 = 0 + 0.814 600 203 238 192 971 776;
  • 65) 0.814 600 203 238 192 971 776 × 2 = 1 + 0.629 200 406 476 385 943 552;
  • 66) 0.629 200 406 476 385 943 552 × 2 = 1 + 0.258 400 812 952 771 887 104;
  • 67) 0.258 400 812 952 771 887 104 × 2 = 0 + 0.516 801 625 905 543 774 208;
  • 68) 0.516 801 625 905 543 774 208 × 2 = 1 + 0.033 603 251 811 087 548 416;
  • 69) 0.033 603 251 811 087 548 416 × 2 = 0 + 0.067 206 503 622 175 096 832;
  • 70) 0.067 206 503 622 175 096 832 × 2 = 0 + 0.134 413 007 244 350 193 664;
  • 71) 0.134 413 007 244 350 193 664 × 2 = 0 + 0.268 826 014 488 700 387 328;
  • 72) 0.268 826 014 488 700 387 328 × 2 = 0 + 0.537 652 028 977 400 774 656;
  • 73) 0.537 652 028 977 400 774 656 × 2 = 1 + 0.075 304 057 954 801 549 312;
  • 74) 0.075 304 057 954 801 549 312 × 2 = 0 + 0.150 608 115 909 603 098 624;
  • 75) 0.150 608 115 909 603 098 624 × 2 = 0 + 0.301 216 231 819 206 197 248;
  • 76) 0.301 216 231 819 206 197 248 × 2 = 0 + 0.602 432 463 638 412 394 496;
  • 77) 0.602 432 463 638 412 394 496 × 2 = 1 + 0.204 864 927 276 824 788 992;
  • 78) 0.204 864 927 276 824 788 992 × 2 = 0 + 0.409 729 854 553 649 577 984;
  • 79) 0.409 729 854 553 649 577 984 × 2 = 0 + 0.819 459 709 107 299 155 968;
  • 80) 0.819 459 709 107 299 155 968 × 2 = 1 + 0.638 919 418 214 598 311 936;
  • 81) 0.638 919 418 214 598 311 936 × 2 = 1 + 0.277 838 836 429 196 623 872;
  • 82) 0.277 838 836 429 196 623 872 × 2 = 0 + 0.555 677 672 858 393 247 744;
  • 83) 0.555 677 672 858 393 247 744 × 2 = 1 + 0.111 355 345 716 786 495 488;
  • 84) 0.111 355 345 716 786 495 488 × 2 = 0 + 0.222 710 691 433 572 990 976;
  • 85) 0.222 710 691 433 572 990 976 × 2 = 0 + 0.445 421 382 867 145 981 952;
  • 86) 0.445 421 382 867 145 981 952 × 2 = 0 + 0.890 842 765 734 291 963 904;
  • 87) 0.890 842 765 734 291 963 904 × 2 = 1 + 0.781 685 531 468 583 927 808;
  • 88) 0.781 685 531 468 583 927 808 × 2 = 1 + 0.563 371 062 937 167 855 616;
  • 89) 0.563 371 062 937 167 855 616 × 2 = 1 + 0.126 742 125 874 335 711 232;
  • 90) 0.126 742 125 874 335 711 232 × 2 = 0 + 0.253 484 251 748 671 422 464;
  • 91) 0.253 484 251 748 671 422 464 × 2 = 0 + 0.506 968 503 497 342 844 928;
  • 92) 0.506 968 503 497 342 844 928 × 2 = 1 + 0.013 937 006 994 685 689 856;
  • 93) 0.013 937 006 994 685 689 856 × 2 = 0 + 0.027 874 013 989 371 379 712;
  • 94) 0.027 874 013 989 371 379 712 × 2 = 0 + 0.055 748 027 978 742 759 424;
  • 95) 0.055 748 027 978 742 759 424 × 2 = 0 + 0.111 496 055 957 485 518 848;
  • 96) 0.111 496 055 957 485 518 848 × 2 = 0 + 0.222 992 111 914 971 037 696;
  • 97) 0.222 992 111 914 971 037 696 × 2 = 0 + 0.445 984 223 829 942 075 392;
  • 98) 0.445 984 223 829 942 075 392 × 2 = 0 + 0.891 968 447 659 884 150 784;
  • 99) 0.891 968 447 659 884 150 784 × 2 = 1 + 0.783 936 895 319 768 301 568;
  • 100) 0.783 936 895 319 768 301 568 × 2 = 1 + 0.567 873 790 639 536 603 136;
  • 101) 0.567 873 790 639 536 603 136 × 2 = 1 + 0.135 747 581 279 073 206 272;
  • 102) 0.135 747 581 279 073 206 272 × 2 = 0 + 0.271 495 162 558 146 412 544;
  • 103) 0.271 495 162 558 146 412 544 × 2 = 0 + 0.542 990 325 116 292 825 088;
  • 104) 0.542 990 325 116 292 825 088 × 2 = 1 + 0.085 980 650 232 585 650 176;
  • 105) 0.085 980 650 232 585 650 176 × 2 = 0 + 0.171 961 300 465 171 300 352;
  • 106) 0.171 961 300 465 171 300 352 × 2 = 0 + 0.343 922 600 930 342 600 704;
  • 107) 0.343 922 600 930 342 600 704 × 2 = 0 + 0.687 845 201 860 685 201 408;
  • 108) 0.687 845 201 860 685 201 408 × 2 = 1 + 0.375 690 403 721 370 402 816;
  • 109) 0.375 690 403 721 370 402 816 × 2 = 0 + 0.751 380 807 442 740 805 632;
  • 110) 0.751 380 807 442 740 805 632 × 2 = 1 + 0.502 761 614 885 481 611 264;
  • 111) 0.502 761 614 885 481 611 264 × 2 = 1 + 0.005 523 229 770 963 222 528;
  • 112) 0.005 523 229 770 963 222 528 × 2 = 0 + 0.011 046 459 541 926 445 056;
  • 113) 0.011 046 459 541 926 445 056 × 2 = 0 + 0.022 092 919 083 852 890 112;
  • 114) 0.022 092 919 083 852 890 112 × 2 = 0 + 0.044 185 838 167 705 780 224;

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 000 000 000 000 000 261(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0100 1101 0000 1000 1001 1010 0011 1001 0000 0011 1001 0001 0110 00(2)

5. Positive number before normalization:

0.000 000 000 000 000 000 261(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0100 1101 0000 1000 1001 1010 0011 1001 0000 0011 1001 0001 0110 00(2)

6. Normalize the binary representation of the number.

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


0.000 000 000 000 000 000 261(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0100 1101 0000 1000 1001 1010 0011 1001 0000 0011 1001 0001 0110 00(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0100 1101 0000 1000 1001 1010 0011 1001 0000 0011 1001 0001 0110 00(2) × 20 =

1.0011 0100 0010 0010 0110 1000 1110 0100 0000 1110 0100 0101 1000(2) × 2-62


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

Mantissa (not normalized):
1.0011 0100 0010 0010 0110 1000 1110 0100 0000 1110 0100 0101 1000


8. Adjust the exponent.

Use the 11 bit excess/bias notation:


Exponent (adjusted) =

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

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

(-62 + 1 023)(10) =

961(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;
  • 961 ÷ 2 = 480 + 1;
  • 480 ÷ 2 = 240 + 0;
  • 240 ÷ 2 = 120 + 0;
  • 120 ÷ 2 = 60 + 0;
  • 60 ÷ 2 = 30 + 0;
  • 30 ÷ 2 = 15 + 0;
  • 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) =

961(10) =

011 1100 0001(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. 0011 0100 0010 0010 0110 1000 1110 0100 0000 1110 0100 0101 1000 =

0011 0100 0010 0010 0110 1000 1110 0100 0000 1110 0100 0101 1000


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 1100 0001

Mantissa (52 bits) =
0011 0100 0010 0010 0110 1000 1110 0100 0000 1110 0100 0101 1000


Decimal number 0.000 000 000 000 000 000 261 converted to 64 bit double precision IEEE 754 binary floating point representation:

0 - 011 1100 0001 - 0011 0100 0010 0010 0110 1000 1110 0100 0000 1110 0100 0101 1000

Share

» Convert decimal 0.000 000 000 000 000 000 207 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 06, 2026 [June]: Decimal Numbers Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard. Calculations performed during the month of: June - by our visitors

» Improve your social skills: Why Do Colleagues From Other Teams Have Better Results?. NotebookLM YouTube Video of 11.31 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