2.444 089 209 850 062 616 169 452 666 887 Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal 2.444 089 209 850 062 616 169 452 666 887(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.444 089 209 850 062 616 169 452 666 887(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.444 089 209 850 062 616 169 452 666 887.

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.444 089 209 850 062 616 169 452 666 887 × 2 = 0 + 0.888 178 419 700 125 232 338 905 333 774;
  • 2) 0.888 178 419 700 125 232 338 905 333 774 × 2 = 1 + 0.776 356 839 400 250 464 677 810 667 548;
  • 3) 0.776 356 839 400 250 464 677 810 667 548 × 2 = 1 + 0.552 713 678 800 500 929 355 621 335 096;
  • 4) 0.552 713 678 800 500 929 355 621 335 096 × 2 = 1 + 0.105 427 357 601 001 858 711 242 670 192;
  • 5) 0.105 427 357 601 001 858 711 242 670 192 × 2 = 0 + 0.210 854 715 202 003 717 422 485 340 384;
  • 6) 0.210 854 715 202 003 717 422 485 340 384 × 2 = 0 + 0.421 709 430 404 007 434 844 970 680 768;
  • 7) 0.421 709 430 404 007 434 844 970 680 768 × 2 = 0 + 0.843 418 860 808 014 869 689 941 361 536;
  • 8) 0.843 418 860 808 014 869 689 941 361 536 × 2 = 1 + 0.686 837 721 616 029 739 379 882 723 072;
  • 9) 0.686 837 721 616 029 739 379 882 723 072 × 2 = 1 + 0.373 675 443 232 059 478 759 765 446 144;
  • 10) 0.373 675 443 232 059 478 759 765 446 144 × 2 = 0 + 0.747 350 886 464 118 957 519 530 892 288;
  • 11) 0.747 350 886 464 118 957 519 530 892 288 × 2 = 1 + 0.494 701 772 928 237 915 039 061 784 576;
  • 12) 0.494 701 772 928 237 915 039 061 784 576 × 2 = 0 + 0.989 403 545 856 475 830 078 123 569 152;
  • 13) 0.989 403 545 856 475 830 078 123 569 152 × 2 = 1 + 0.978 807 091 712 951 660 156 247 138 304;
  • 14) 0.978 807 091 712 951 660 156 247 138 304 × 2 = 1 + 0.957 614 183 425 903 320 312 494 276 608;
  • 15) 0.957 614 183 425 903 320 312 494 276 608 × 2 = 1 + 0.915 228 366 851 806 640 624 988 553 216;
  • 16) 0.915 228 366 851 806 640 624 988 553 216 × 2 = 1 + 0.830 456 733 703 613 281 249 977 106 432;
  • 17) 0.830 456 733 703 613 281 249 977 106 432 × 2 = 1 + 0.660 913 467 407 226 562 499 954 212 864;
  • 18) 0.660 913 467 407 226 562 499 954 212 864 × 2 = 1 + 0.321 826 934 814 453 124 999 908 425 728;
  • 19) 0.321 826 934 814 453 124 999 908 425 728 × 2 = 0 + 0.643 653 869 628 906 249 999 816 851 456;
  • 20) 0.643 653 869 628 906 249 999 816 851 456 × 2 = 1 + 0.287 307 739 257 812 499 999 633 702 912;
  • 21) 0.287 307 739 257 812 499 999 633 702 912 × 2 = 0 + 0.574 615 478 515 624 999 999 267 405 824;
  • 22) 0.574 615 478 515 624 999 999 267 405 824 × 2 = 1 + 0.149 230 957 031 249 999 998 534 811 648;
  • 23) 0.149 230 957 031 249 999 998 534 811 648 × 2 = 0 + 0.298 461 914 062 499 999 997 069 623 296;
  • 24) 0.298 461 914 062 499 999 997 069 623 296 × 2 = 0 + 0.596 923 828 124 999 999 994 139 246 592;
  • 25) 0.596 923 828 124 999 999 994 139 246 592 × 2 = 1 + 0.193 847 656 249 999 999 988 278 493 184;
  • 26) 0.193 847 656 249 999 999 988 278 493 184 × 2 = 0 + 0.387 695 312 499 999 999 976 556 986 368;
  • 27) 0.387 695 312 499 999 999 976 556 986 368 × 2 = 0 + 0.775 390 624 999 999 999 953 113 972 736;
  • 28) 0.775 390 624 999 999 999 953 113 972 736 × 2 = 1 + 0.550 781 249 999 999 999 906 227 945 472;
  • 29) 0.550 781 249 999 999 999 906 227 945 472 × 2 = 1 + 0.101 562 499 999 999 999 812 455 890 944;
  • 30) 0.101 562 499 999 999 999 812 455 890 944 × 2 = 0 + 0.203 124 999 999 999 999 624 911 781 888;
  • 31) 0.203 124 999 999 999 999 624 911 781 888 × 2 = 0 + 0.406 249 999 999 999 999 249 823 563 776;
  • 32) 0.406 249 999 999 999 999 249 823 563 776 × 2 = 0 + 0.812 499 999 999 999 998 499 647 127 552;
  • 33) 0.812 499 999 999 999 998 499 647 127 552 × 2 = 1 + 0.624 999 999 999 999 996 999 294 255 104;
  • 34) 0.624 999 999 999 999 996 999 294 255 104 × 2 = 1 + 0.249 999 999 999 999 993 998 588 510 208;
  • 35) 0.249 999 999 999 999 993 998 588 510 208 × 2 = 0 + 0.499 999 999 999 999 987 997 177 020 416;
  • 36) 0.499 999 999 999 999 987 997 177 020 416 × 2 = 0 + 0.999 999 999 999 999 975 994 354 040 832;
  • 37) 0.999 999 999 999 999 975 994 354 040 832 × 2 = 1 + 0.999 999 999 999 999 951 988 708 081 664;
  • 38) 0.999 999 999 999 999 951 988 708 081 664 × 2 = 1 + 0.999 999 999 999 999 903 977 416 163 328;
  • 39) 0.999 999 999 999 999 903 977 416 163 328 × 2 = 1 + 0.999 999 999 999 999 807 954 832 326 656;
  • 40) 0.999 999 999 999 999 807 954 832 326 656 × 2 = 1 + 0.999 999 999 999 999 615 909 664 653 312;
  • 41) 0.999 999 999 999 999 615 909 664 653 312 × 2 = 1 + 0.999 999 999 999 999 231 819 329 306 624;
  • 42) 0.999 999 999 999 999 231 819 329 306 624 × 2 = 1 + 0.999 999 999 999 998 463 638 658 613 248;
  • 43) 0.999 999 999 999 998 463 638 658 613 248 × 2 = 1 + 0.999 999 999 999 996 927 277 317 226 496;
  • 44) 0.999 999 999 999 996 927 277 317 226 496 × 2 = 1 + 0.999 999 999 999 993 854 554 634 452 992;
  • 45) 0.999 999 999 999 993 854 554 634 452 992 × 2 = 1 + 0.999 999 999 999 987 709 109 268 905 984;
  • 46) 0.999 999 999 999 987 709 109 268 905 984 × 2 = 1 + 0.999 999 999 999 975 418 218 537 811 968;
  • 47) 0.999 999 999 999 975 418 218 537 811 968 × 2 = 1 + 0.999 999 999 999 950 836 437 075 623 936;
  • 48) 0.999 999 999 999 950 836 437 075 623 936 × 2 = 1 + 0.999 999 999 999 901 672 874 151 247 872;
  • 49) 0.999 999 999 999 901 672 874 151 247 872 × 2 = 1 + 0.999 999 999 999 803 345 748 302 495 744;
  • 50) 0.999 999 999 999 803 345 748 302 495 744 × 2 = 1 + 0.999 999 999 999 606 691 496 604 991 488;
  • 51) 0.999 999 999 999 606 691 496 604 991 488 × 2 = 1 + 0.999 999 999 999 213 382 993 209 982 976;
  • 52) 0.999 999 999 999 213 382 993 209 982 976 × 2 = 1 + 0.999 999 999 998 426 765 986 419 965 952;
  • 53) 0.999 999 999 998 426 765 986 419 965 952 × 2 = 1 + 0.999 999 999 996 853 531 972 839 931 904;

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.444 089 209 850 062 616 169 452 666 887(10) =

0.0111 0001 1010 1111 1101 0100 1001 1000 1100 1111 1111 1111 1111 1(2)

5. Positive number before normalization:

2.444 089 209 850 062 616 169 452 666 887(10) =

10.0111 0001 1010 1111 1101 0100 1001 1000 1100 1111 1111 1111 1111 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.444 089 209 850 062 616 169 452 666 887(10) =

10.0111 0001 1010 1111 1101 0100 1001 1000 1100 1111 1111 1111 1111 1(2) =

10.0111 0001 1010 1111 1101 0100 1001 1000 1100 1111 1111 1111 1111 1(2) × 20 =

1.0011 1000 1101 0111 1110 1010 0100 1100 0110 0111 1111 1111 1111 11(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.0011 1000 1101 0111 1110 1010 0100 1100 0110 0111 1111 1111 1111 11


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. 0011 1000 1101 0111 1110 1010 0100 1100 0110 0111 1111 1111 1111 11 =

0011 1000 1101 0111 1110 1010 0100 1100 0110 0111 1111 1111 1111


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) =
0011 1000 1101 0111 1110 1010 0100 1100 0110 0111 1111 1111 1111


Decimal number 2.444 089 209 850 062 616 169 452 666 887 converted to 64 bit double precision IEEE 754 binary floating point representation:

0 - 100 0000 0000 - 0011 1000 1101 0111 1110 1010 0100 1100 0110 0111 1111 1111 1111

» Convert decimal 2.444 089 209 850 062 616 169 452 666 9 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