64 bit double precision IEEE 754 binary floating point number 0 - 111 1111 1111 - 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 converted to decimal base ten (double)

How to convert 64 bit double precision IEEE 754 binary floating point:
0 - 111 1111 1111 - 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000.

1. Identify the elements that make up the binary representation of the number:

First bit (the leftmost) indicates the sign,
1 = negative, 0 = positive.


The next 11 bits contain the exponent:
111 1111 1111


The last 52 bits contain the mantissa:
0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000

Notice that all the exponent bits are on 1 (set) and all the mantissa bits are on 0 (clear).

This is the reserved bitpattern of the special value of: Infinity (∞).

The sign bit distinguishes between negative infinity (-∞) and positive infinity (+∞).

Conclusion:

0 - 111 1111 1111 - 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000
converted from
64 bit double precision IEEE 754 binary floating point
to
base ten decimal system (double) =


+∞ (Infinity, positive)

Convert 64 bit double precision IEEE 754 floating point standard binary numbers to base ten decimal system (double)

64 bit double precision IEEE 754 binary floating point standard representation of numbers requires three building blocks: sign (it takes 1 bit and it's either 0 for positive or 1 for negative numbers), exponent (11 bits), mantissa (52 bits)

Latest 64 bit double precision IEEE 754 floating point binary standard numbers converted to decimal base ten (double)

0 - 111 1111 1111 - 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 = +∞ (Infinity, positive) Jun 03 09:32 UTC (GMT)
0 - 100 0000 1010 - 1010 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 = 3 328 Jun 03 08:53 UTC (GMT)
1 - 100 0000 1110 - 1000 1001 0001 0100 0000 0100 0000 0010 0000 0000 1000 0000 0000 = -50 314.007 827 773 690 223 693 847 656 25 Jun 03 08:52 UTC (GMT)
1 - 111 1111 1111 - 0001 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 = SNaN, Signalling Not a Number Jun 03 08:49 UTC (GMT)
0 - 100 0000 0011 - 1100 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 = 28 Jun 03 08:37 UTC (GMT)
0 - 100 0001 1000 - 0010 0000 1111 1111 1111 0100 1010 1010 1101 0000 1000 0000 1010 = 37 879 785.334 487 989 544 868 469 238 281 25 Jun 03 08:32 UTC (GMT)
1 - 100 0011 1111 - 1000 0111 0101 1100 1001 0110 0000 0000 0000 0000 0000 0000 0000 = -28 200 579 893 431 369 728 Jun 03 08:26 UTC (GMT)
1 - 000 0001 1110 - 0000 0000 0001 0101 0001 0111 1010 1001 0110 0000 0111 1000 0000 = -0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 011 949 618 9 Jun 03 08:19 UTC (GMT)
0 - 101 1111 0000 - 0011 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 = 485 893 918 359 583 558 830 082 845 622 846 749 157 157 803 709 517 429 688 926 062 451 769 860 403 818 879 240 485 404 329 626 398 327 084 742 175 184 698 040 430 686 518 529 863 031 353 453 314 048 Jun 03 08:15 UTC (GMT)
0 - 100 0000 0000 - 1100 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 = 3.5 Jun 03 08:15 UTC (GMT)
0 - 111 0000 0000 - 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 = 3 105 036 184 601 417 870 297 958 976 925 005 110 513 772 034 233 393 222 278 104 076 052 101 905 372 753 772 661 756 817 657 292 955 900 975 461 394 262 146 412 343 160 088 229 628 782 888 574 550 082 362 278 408 909 952 041 699 811 100 530 571 263 196 889 650 525 998 387 432 937 501 785 693 707 632 115 712 Jun 03 08:10 UTC (GMT)
0 - 100 0000 1000 - 0110 1010 1011 1011 1001 1000 0000 0000 0000 0000 0000 0000 0000 = 725.465 576 171 875 Jun 03 08:10 UTC (GMT)
0 - 010 1010 0110 - 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 = 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 013 952 482 803 738 708 279 001 264 017 399 181 633 934 448 178 989 241 469 911 204 140 962 312 450 033 425 240 178 808 860 597 803 096 303 504 081 462 085 305 569 098 405 301 317 367 567 456 570 964 478 042 504 461 841 032 422 915 783 794 626 949 498 926 100 654 634 836 7 Jun 03 08:02 UTC (GMT)
All base ten decimal numbers converted to 64 bit double precision IEEE 754 binary floating point

How to convert numbers from 64 bit double precision IEEE 754 binary floating point standard to decimal system in base 10

Follow the steps below to convert a number from 64 bit double precision IEEE 754 binary floating point representation to base 10 decimal system:

  • 1. Identify the elements that make up the binary representation of the number:
    First bit (leftmost) indicates the sign, 1 = negative, 0 = pozitive.
    The next 11 bits contain the exponent.
    The last 52 bits contain the mantissa.
  • 2. Convert the exponent, that is allways a positive integer, from binary (base 2) to decimal (base 10).
  • 3. Adjust the exponent, subtract the excess bits, 2(11 - 1) - 1 = 1,023, that is due to the 11 bit excess/bias notation.
  • 4. Convert the mantissa, that represents the number's fractional part (the excess beyond the number's integer part, comma delimited), from binary (base 2) to decimal (base 10).
  • 5. Put all the numbers into expression to calculate the double precision floating point decimal value:
    (-1)Sign × (1 + Mantissa) × 2(Exponent adjusted)

Example: convert the number 1 - 100 0011 1101 - 1000 0000 0010 0001 0100 0000 0100 1110 0000 0100 0000 1010 1000 from 64 bit double precision IEEE 754 binary floating point system to base ten decimal (double):

  • 1. Identify the elements that make up the binary representation of the number:
    First bit (leftmost) indicates the sign, 1 = negative, 0 = pozitive.
    The next 11 bits contain the exponent: 100 0011 1101
    The last 52 bits contain the mantissa:
    1000 0000 0010 0001 0100 0000 0100 1110 0000 0100 0000 1010 1000
  • 2. Convert the exponent, that is allways a positive integer, from binary (base 2) to decimal (base 10):
    100 0011 1101(2) =
    1 × 210 + 0 × 29 + 0 × 28 + 0 × 27 + 0 × 26 + 1 × 25 + 1 × 24 + 1 × 23 + 1 × 22 + 0 × 21 + 1 × 20 =
    1,024 + 0 + 0 + 0 + 0 + 32 + 16 + 8 + 4 + 0 + 1 =
    1,024 + 32 + 16 + 8 + 4 + 1 =
    1,085(10)
  • 3. Adjust the exponent, subtract the excess bits, 2(11 - 1) - 1 = 1,023, that is due to the 11 bit excess/bias notation:
    Exponent adjusted = 1,085 - 1,023 = 62
  • 4. Convert the mantissa, that represents the number's fractional part (the excess beyond the number's integer part, comma delimited), from binary (base 2) to decimal (base 10):
    1000 0000 0010 0001 0100 0000 0100 1110 0000 0100 0000 1010 1000(2) =
    1 × 2-1 + 0 × 2-2 + 0 × 2-3 + 0 × 2-4 + 0 × 2-5 + 0 × 2-6 + 0 × 2-7 + 0 × 2-8 + 0 × 2-9 + 0 × 2-10 + 1 × 2-11 + 0 × 2-12 + 0 × 2-13 + 0 × 2-14 + 0 × 2-15 + 1 × 2-16 + 0 × 2-17 + 1 × 2-18 + 0 × 2-19 + 0 × 2-20 + 0 × 2-21 + 0 × 2-22 + 0 × 2-23 + 0 × 2-24 + 0 × 2-25 + 1 × 2-26 + 0 × 2-27 + 0 × 2-28 + 1 × 2-29 + 1 × 2-30 + 1 × 2-31 + 0 × 2-32 + 0 × 2-33 + 0 × 2-34 + 0 × 2-35 + 0 × 2-36 + 0 × 2-37 + 1 × 2-38 + 0 × 2-39 + 0 × 2-40 + 0 × 2-41 + 0 × 2-42 + 0 × 2-43 + 0 × 2-44 + 1 × 2-45 + 0 × 2-46 + 1 × 2-47 + 0 × 2-48 + 1 × 2-49 + 0 × 2-50 + 0 × 2-51 + 0 × 2-52 =
    0.5 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0.000 488 281 25 + 0 + 0 + 0 + 0 + 0.000 015 258 789 062 5 + 0 + 0.000 003 814 697 265 625 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0.000 000 014 901 161 193 847 656 25 + 0 + 0 + 0.000 000 001 862 645 149 230 957 031 25 + 0.000 000 000 931 322 574 615 478 515 625 + 0.000 000 000 465 661 287 307 739 257 812 5 + 0 + 0 + 0 + 0 + 0 + 0 + 0.000 000 000 003 637 978 807 091 712 951 660 156 25 + 0 + 0 + 0 + 0 + 0 + 0 + 0.000 000 000 000 028 421 709 430 404 007 434 844 970 703 125 + 0 + 0.000 000 000 000 007 105 427 357 601 001 858 711 242 675 781 25 + 0 + 0.000 000 000 000 001 776 356 839 400 250 464 677 810 668 945 312 5 + 0 + 0 + 0 =
    0.5 + 0.000 488 281 25 + 0.000 015 258 789 062 5 + 0.000 003 814 697 265 625 + 0.000 000 014 901 161 193 847 656 25 + 0.000 000 001 862 645 149 230 957 031 25 + 0.000 000 000 931 322 574 615 478 515 625 + 0.000 000 000 465 661 287 307 739 257 812 5 + 0.000 000 000 003 637 978 807 091 712 951 660 156 25 + 0.000 000 000 000 028 421 709 430 404 007 434 844 970 703 125 + 0.000 000 000 000 007 105 427 357 601 001 858 711 242 675 781 25 + 0.000 000 000 000 001 776 356 839 400 250 464 677 810 668 945 312 5 =
    0.500 507 372 900 793 612 302 550 172 898 918 390 274 047 851 562 5(10)
  • 5. Put all the numbers into expression to calculate the double precision floating point decimal value:
    (-1)Sign × (1 + Mantissa) × 2(Exponent adjusted) =
    (-1)1 × (1 + 0.500 507 372 900 793 612 302 550 172 898 918 390 274 047 851 562 5) × 262 =
    -1.500 507 372 900 793 612 302 550 172 898 918 390 274 047 851 562 5 × 262 =
    -6 919 868 872 153 800 704(10)
  • 1 - 100 0011 1101 - 1000 0000 0010 0001 0100 0000 0100 1110 0000 0100 0000 1010 1000 converted from 64 bit double precision IEEE 754 binary floating point representation to a decimal number (float) in decimal system (in base 10) = -6 919 868 872 153 800 704(10)