0.648 419 777 325 504 832 966 877 062 5 Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal 0.648 419 777 325 504 832 966 877 062 5(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.648 419 777 325 504 832 966 877 062 5(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.648 419 777 325 504 832 966 877 062 5.

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.648 419 777 325 504 832 966 877 062 5 × 2 = 1 + 0.296 839 554 651 009 665 933 754 125;
  • 2) 0.296 839 554 651 009 665 933 754 125 × 2 = 0 + 0.593 679 109 302 019 331 867 508 25;
  • 3) 0.593 679 109 302 019 331 867 508 25 × 2 = 1 + 0.187 358 218 604 038 663 735 016 5;
  • 4) 0.187 358 218 604 038 663 735 016 5 × 2 = 0 + 0.374 716 437 208 077 327 470 033;
  • 5) 0.374 716 437 208 077 327 470 033 × 2 = 0 + 0.749 432 874 416 154 654 940 066;
  • 6) 0.749 432 874 416 154 654 940 066 × 2 = 1 + 0.498 865 748 832 309 309 880 132;
  • 7) 0.498 865 748 832 309 309 880 132 × 2 = 0 + 0.997 731 497 664 618 619 760 264;
  • 8) 0.997 731 497 664 618 619 760 264 × 2 = 1 + 0.995 462 995 329 237 239 520 528;
  • 9) 0.995 462 995 329 237 239 520 528 × 2 = 1 + 0.990 925 990 658 474 479 041 056;
  • 10) 0.990 925 990 658 474 479 041 056 × 2 = 1 + 0.981 851 981 316 948 958 082 112;
  • 11) 0.981 851 981 316 948 958 082 112 × 2 = 1 + 0.963 703 962 633 897 916 164 224;
  • 12) 0.963 703 962 633 897 916 164 224 × 2 = 1 + 0.927 407 925 267 795 832 328 448;
  • 13) 0.927 407 925 267 795 832 328 448 × 2 = 1 + 0.854 815 850 535 591 664 656 896;
  • 14) 0.854 815 850 535 591 664 656 896 × 2 = 1 + 0.709 631 701 071 183 329 313 792;
  • 15) 0.709 631 701 071 183 329 313 792 × 2 = 1 + 0.419 263 402 142 366 658 627 584;
  • 16) 0.419 263 402 142 366 658 627 584 × 2 = 0 + 0.838 526 804 284 733 317 255 168;
  • 17) 0.838 526 804 284 733 317 255 168 × 2 = 1 + 0.677 053 608 569 466 634 510 336;
  • 18) 0.677 053 608 569 466 634 510 336 × 2 = 1 + 0.354 107 217 138 933 269 020 672;
  • 19) 0.354 107 217 138 933 269 020 672 × 2 = 0 + 0.708 214 434 277 866 538 041 344;
  • 20) 0.708 214 434 277 866 538 041 344 × 2 = 1 + 0.416 428 868 555 733 076 082 688;
  • 21) 0.416 428 868 555 733 076 082 688 × 2 = 0 + 0.832 857 737 111 466 152 165 376;
  • 22) 0.832 857 737 111 466 152 165 376 × 2 = 1 + 0.665 715 474 222 932 304 330 752;
  • 23) 0.665 715 474 222 932 304 330 752 × 2 = 1 + 0.331 430 948 445 864 608 661 504;
  • 24) 0.331 430 948 445 864 608 661 504 × 2 = 0 + 0.662 861 896 891 729 217 323 008;
  • 25) 0.662 861 896 891 729 217 323 008 × 2 = 1 + 0.325 723 793 783 458 434 646 016;
  • 26) 0.325 723 793 783 458 434 646 016 × 2 = 0 + 0.651 447 587 566 916 869 292 032;
  • 27) 0.651 447 587 566 916 869 292 032 × 2 = 1 + 0.302 895 175 133 833 738 584 064;
  • 28) 0.302 895 175 133 833 738 584 064 × 2 = 0 + 0.605 790 350 267 667 477 168 128;
  • 29) 0.605 790 350 267 667 477 168 128 × 2 = 1 + 0.211 580 700 535 334 954 336 256;
  • 30) 0.211 580 700 535 334 954 336 256 × 2 = 0 + 0.423 161 401 070 669 908 672 512;
  • 31) 0.423 161 401 070 669 908 672 512 × 2 = 0 + 0.846 322 802 141 339 817 345 024;
  • 32) 0.846 322 802 141 339 817 345 024 × 2 = 1 + 0.692 645 604 282 679 634 690 048;
  • 33) 0.692 645 604 282 679 634 690 048 × 2 = 1 + 0.385 291 208 565 359 269 380 096;
  • 34) 0.385 291 208 565 359 269 380 096 × 2 = 0 + 0.770 582 417 130 718 538 760 192;
  • 35) 0.770 582 417 130 718 538 760 192 × 2 = 1 + 0.541 164 834 261 437 077 520 384;
  • 36) 0.541 164 834 261 437 077 520 384 × 2 = 1 + 0.082 329 668 522 874 155 040 768;
  • 37) 0.082 329 668 522 874 155 040 768 × 2 = 0 + 0.164 659 337 045 748 310 081 536;
  • 38) 0.164 659 337 045 748 310 081 536 × 2 = 0 + 0.329 318 674 091 496 620 163 072;
  • 39) 0.329 318 674 091 496 620 163 072 × 2 = 0 + 0.658 637 348 182 993 240 326 144;
  • 40) 0.658 637 348 182 993 240 326 144 × 2 = 1 + 0.317 274 696 365 986 480 652 288;
  • 41) 0.317 274 696 365 986 480 652 288 × 2 = 0 + 0.634 549 392 731 972 961 304 576;
  • 42) 0.634 549 392 731 972 961 304 576 × 2 = 1 + 0.269 098 785 463 945 922 609 152;
  • 43) 0.269 098 785 463 945 922 609 152 × 2 = 0 + 0.538 197 570 927 891 845 218 304;
  • 44) 0.538 197 570 927 891 845 218 304 × 2 = 1 + 0.076 395 141 855 783 690 436 608;
  • 45) 0.076 395 141 855 783 690 436 608 × 2 = 0 + 0.152 790 283 711 567 380 873 216;
  • 46) 0.152 790 283 711 567 380 873 216 × 2 = 0 + 0.305 580 567 423 134 761 746 432;
  • 47) 0.305 580 567 423 134 761 746 432 × 2 = 0 + 0.611 161 134 846 269 523 492 864;
  • 48) 0.611 161 134 846 269 523 492 864 × 2 = 1 + 0.222 322 269 692 539 046 985 728;
  • 49) 0.222 322 269 692 539 046 985 728 × 2 = 0 + 0.444 644 539 385 078 093 971 456;
  • 50) 0.444 644 539 385 078 093 971 456 × 2 = 0 + 0.889 289 078 770 156 187 942 912;
  • 51) 0.889 289 078 770 156 187 942 912 × 2 = 1 + 0.778 578 157 540 312 375 885 824;
  • 52) 0.778 578 157 540 312 375 885 824 × 2 = 1 + 0.557 156 315 080 624 751 771 648;
  • 53) 0.557 156 315 080 624 751 771 648 × 2 = 1 + 0.114 312 630 161 249 503 543 296;

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.648 419 777 325 504 832 966 877 062 5(10) =

0.1010 0101 1111 1110 1101 0110 1010 1001 1011 0001 0101 0001 0011 1(2)

5. Positive number before normalization:

0.648 419 777 325 504 832 966 877 062 5(10) =

0.1010 0101 1111 1110 1101 0110 1010 1001 1011 0001 0101 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.648 419 777 325 504 832 966 877 062 5(10) =

0.1010 0101 1111 1110 1101 0110 1010 1001 1011 0001 0101 0001 0011 1(2) =

0.1010 0101 1111 1110 1101 0110 1010 1001 1011 0001 0101 0001 0011 1(2) × 20 =

1.0100 1011 1111 1101 1010 1101 0101 0011 0110 0010 1010 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.0100 1011 1111 1101 1010 1101 0101 0011 0110 0010 1010 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. 0100 1011 1111 1101 1010 1101 0101 0011 0110 0010 1010 0010 0111 =

0100 1011 1111 1101 1010 1101 0101 0011 0110 0010 1010 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) =
0100 1011 1111 1101 1010 1101 0101 0011 0110 0010 1010 0010 0111


Decimal number 0.648 419 777 325 504 832 966 877 062 5 converted to 64 bit double precision IEEE 754 binary floating point representation:

0 - 011 1111 1110 - 0100 1011 1111 1101 1010 1101 0101 0011 0110 0010 1010 0010 0111

» Convert decimal 0.648 419 777 325 504 832 966 877 061 3 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

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