64 bit double precision IEEE 754 binary floating point number 1 - 100 0011 1111 - 1000 0111 0101 1100 1001 0110 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:
1 - 100 0011 1111 - 1000 0111 0101 1100 1001 0110 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:
100 0011 1111


The last 52 bits contain the mantissa:
1000 0111 0101 1100 1001 0110 0000 0000 0000 0000 0000 0000 0000

2. Convert the exponent, that is allways a positive integer, from binary (base 2) to decimal (base 10):

100 0011 1111(2) =


1 × 210 + 0 × 29 + 0 × 28 + 0 × 27 + 0 × 26 + 1 × 25 + 1 × 24 + 1 × 23 + 1 × 22 + 1 × 21 + 1 × 20 =


1,024 + 0 + 0 + 0 + 0 + 32 + 16 + 8 + 4 + 2 + 1 =


1,024 + 32 + 16 + 8 + 4 + 2 + 1 =


1,087(10)

3. Adjust the exponent, subtract the excess bits, 2(11 - 1) - 1 = 1023, that is due to the 11 bit excess/bias notation:

Exponent adjusted = 1,087 - 1023 = 64

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 0111 0101 1100 1001 0110 0000 0000 0000 0000 0000 0000 0000(2) =

1 × 2-1 + 0 × 2-2 + 0 × 2-3 + 0 × 2-4 + 0 × 2-5 + 1 × 2-6 + 1 × 2-7 + 1 × 2-8 + 0 × 2-9 + 1 × 2-10 + 0 × 2-11 + 1 × 2-12 + 1 × 2-13 + 1 × 2-14 + 0 × 2-15 + 0 × 2-16 + 1 × 2-17 + 0 × 2-18 + 0 × 2-19 + 1 × 2-20 + 0 × 2-21 + 1 × 2-22 + 1 × 2-23 + 0 × 2-24 + 0 × 2-25 + 0 × 2-26 + 0 × 2-27 + 0 × 2-28 + 0 × 2-29 + 0 × 2-30 + 0 × 2-31 + 0 × 2-32 + 0 × 2-33 + 0 × 2-34 + 0 × 2-35 + 0 × 2-36 + 0 × 2-37 + 0 × 2-38 + 0 × 2-39 + 0 × 2-40 + 0 × 2-41 + 0 × 2-42 + 0 × 2-43 + 0 × 2-44 + 0 × 2-45 + 0 × 2-46 + 0 × 2-47 + 0 × 2-48 + 0 × 2-49 + 0 × 2-50 + 0 × 2-51 + 0 × 2-52 =


0.5 + 0 + 0 + 0 + 0 + 0.015 625 + 0.007 812 5 + 0.003 906 25 + 0 + 0.000 976 562 5 + 0 + 0.000 244 140 625 + 0.000 122 070 312 5 + 0.000 061 035 156 25 + 0 + 0 + 0.000 007 629 394 531 25 + 0 + 0 + 0.000 000 953 674 316 406 25 + 0 + 0.000 000 238 418 579 101 562 5 + 0.000 000 119 209 289 550 781 25 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 =


0.5 + 0.015 625 + 0.007 812 5 + 0.003 906 25 + 0.000 976 562 5 + 0.000 244 140 625 + 0.000 122 070 312 5 + 0.000 061 035 156 25 + 0.000 007 629 394 531 25 + 0.000 000 953 674 316 406 25 + 0.000 000 238 418 579 101 562 5 + 0.000 000 119 209 289 550 781 25 =


0.528 756 499 290 466 308 593 75(10)

Conclusion:

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.528 756 499 290 466 308 593 75) × 264 =


-1.528 756 499 290 466 308 593 75 × 264 =


-28 200 579 893 431 369 728

1 - 100 0011 1111 - 1000 0111 0101 1100 1001 0110 0000 0000 0000 0000 0000 0000 0000
converted from
64 bit double precision IEEE 754 binary floating point
to
base ten decimal system (double) =


-28 200 579 893 431 369 728(10)

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)

1 - 100 0011 1111 - 1000 0111 0101 1100 1001 0110 0000 0000 0000 0000 0000 0000 0000 = -28 200 579 893 431 369 728 Nov 18 16:23 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 Nov 18 16:23 UTC (GMT)
1 - 101 0000 1001 - 1010 0001 0010 1000 0011 1111 1100 1101 0000 0100 0111 1110 1001 = -193 214 025 808 993 738 604 101 112 860 072 347 767 196 659 945 695 490 958 841 510 140 506 787 897 409 536 Nov 18 16:22 UTC (GMT)
0 - 100 0000 0010 - 0100 1100 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 = 10.375 Nov 18 16:22 UTC (GMT)
0 - 011 1111 1111 - 0101 0011 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 = 1.324 218 750 000 000 222 044 604 925 031 308 084 726 333 618 164 062 5 Nov 18 16:18 UTC (GMT)
1 - 100 1100 0111 - 0111 0110 0110 0000 0110 0000 1001 0011 0101 1010 1010 0101 0110 = -2 349 999 212 290 342 694 039 218 688 336 252 332 275 839 940 449 760 595 410 944 Nov 18 16:18 UTC (GMT)
0 - 100 0001 1000 - 1010 0011 1111 1011 1010 1011 0001 1111 1011 1001 1111 0111 1100 = 55 048 022.247 862 786 054 611 206 054 687 5 Nov 18 16:18 UTC (GMT)
0 - 100 1000 0000 - 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 = 680 564 733 841 876 926 926 749 214 863 536 422 912 Nov 18 16:17 UTC (GMT)
1 - 100 0011 0101 - 0000 1010 1010 1111 1010 1010 0010 0101 0111 0100 0101 0101 0110 = -18 766 372 278 179 160 Nov 18 16:17 UTC (GMT)
1 - 111 1111 1111 - 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1100 0011 = QNaN, Quiet Not a Number Nov 18 16:16 UTC (GMT)
0 - 010 0000 0010 - 1001 1000 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 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 950 938 443 228 026 359 769 598 077 721 524 064 265 500 120 661 551 879 019 618 587 483 800 494 096 440 083 879 362 298 526 054 544 928 592 729 415 119 102 935 310 122 832 141 226 089 211 986 015 772 990 6 Nov 18 16:16 UTC (GMT)
0 - 011 1111 1010 - 1001 1001 1001 1001 1001 1001 1001 1001 1001 1001 1001 1000 0000 = 0.049 999 999 999 999 822 364 316 059 974 953 532 218 933 105 468 75 Nov 18 16:12 UTC (GMT)
0 - 100 0001 0011 - 0000 1101 1111 1010 1110 0111 0110 0010 1101 1111 0100 1010 1100 = 1 105 838.461 638 729 088 008 403 778 076 171 875 Nov 18 16:11 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)