-0.000 000 000 000 176 624 Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal -0.000 000 000 000 176 624(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 176 624(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. Start with the positive version of the number:

|-0.000 000 000 000 176 624| = 0.000 000 000 000 176 624


2. 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;

3. 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)


4. Convert to binary (base 2) the fractional part: 0.000 000 000 000 176 624.

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 176 624 × 2 = 0 + 0.000 000 000 000 353 248;
  • 2) 0.000 000 000 000 353 248 × 2 = 0 + 0.000 000 000 000 706 496;
  • 3) 0.000 000 000 000 706 496 × 2 = 0 + 0.000 000 000 001 412 992;
  • 4) 0.000 000 000 001 412 992 × 2 = 0 + 0.000 000 000 002 825 984;
  • 5) 0.000 000 000 002 825 984 × 2 = 0 + 0.000 000 000 005 651 968;
  • 6) 0.000 000 000 005 651 968 × 2 = 0 + 0.000 000 000 011 303 936;
  • 7) 0.000 000 000 011 303 936 × 2 = 0 + 0.000 000 000 022 607 872;
  • 8) 0.000 000 000 022 607 872 × 2 = 0 + 0.000 000 000 045 215 744;
  • 9) 0.000 000 000 045 215 744 × 2 = 0 + 0.000 000 000 090 431 488;
  • 10) 0.000 000 000 090 431 488 × 2 = 0 + 0.000 000 000 180 862 976;
  • 11) 0.000 000 000 180 862 976 × 2 = 0 + 0.000 000 000 361 725 952;
  • 12) 0.000 000 000 361 725 952 × 2 = 0 + 0.000 000 000 723 451 904;
  • 13) 0.000 000 000 723 451 904 × 2 = 0 + 0.000 000 001 446 903 808;
  • 14) 0.000 000 001 446 903 808 × 2 = 0 + 0.000 000 002 893 807 616;
  • 15) 0.000 000 002 893 807 616 × 2 = 0 + 0.000 000 005 787 615 232;
  • 16) 0.000 000 005 787 615 232 × 2 = 0 + 0.000 000 011 575 230 464;
  • 17) 0.000 000 011 575 230 464 × 2 = 0 + 0.000 000 023 150 460 928;
  • 18) 0.000 000 023 150 460 928 × 2 = 0 + 0.000 000 046 300 921 856;
  • 19) 0.000 000 046 300 921 856 × 2 = 0 + 0.000 000 092 601 843 712;
  • 20) 0.000 000 092 601 843 712 × 2 = 0 + 0.000 000 185 203 687 424;
  • 21) 0.000 000 185 203 687 424 × 2 = 0 + 0.000 000 370 407 374 848;
  • 22) 0.000 000 370 407 374 848 × 2 = 0 + 0.000 000 740 814 749 696;
  • 23) 0.000 000 740 814 749 696 × 2 = 0 + 0.000 001 481 629 499 392;
  • 24) 0.000 001 481 629 499 392 × 2 = 0 + 0.000 002 963 258 998 784;
  • 25) 0.000 002 963 258 998 784 × 2 = 0 + 0.000 005 926 517 997 568;
  • 26) 0.000 005 926 517 997 568 × 2 = 0 + 0.000 011 853 035 995 136;
  • 27) 0.000 011 853 035 995 136 × 2 = 0 + 0.000 023 706 071 990 272;
  • 28) 0.000 023 706 071 990 272 × 2 = 0 + 0.000 047 412 143 980 544;
  • 29) 0.000 047 412 143 980 544 × 2 = 0 + 0.000 094 824 287 961 088;
  • 30) 0.000 094 824 287 961 088 × 2 = 0 + 0.000 189 648 575 922 176;
  • 31) 0.000 189 648 575 922 176 × 2 = 0 + 0.000 379 297 151 844 352;
  • 32) 0.000 379 297 151 844 352 × 2 = 0 + 0.000 758 594 303 688 704;
  • 33) 0.000 758 594 303 688 704 × 2 = 0 + 0.001 517 188 607 377 408;
  • 34) 0.001 517 188 607 377 408 × 2 = 0 + 0.003 034 377 214 754 816;
  • 35) 0.003 034 377 214 754 816 × 2 = 0 + 0.006 068 754 429 509 632;
  • 36) 0.006 068 754 429 509 632 × 2 = 0 + 0.012 137 508 859 019 264;
  • 37) 0.012 137 508 859 019 264 × 2 = 0 + 0.024 275 017 718 038 528;
  • 38) 0.024 275 017 718 038 528 × 2 = 0 + 0.048 550 035 436 077 056;
  • 39) 0.048 550 035 436 077 056 × 2 = 0 + 0.097 100 070 872 154 112;
  • 40) 0.097 100 070 872 154 112 × 2 = 0 + 0.194 200 141 744 308 224;
  • 41) 0.194 200 141 744 308 224 × 2 = 0 + 0.388 400 283 488 616 448;
  • 42) 0.388 400 283 488 616 448 × 2 = 0 + 0.776 800 566 977 232 896;
  • 43) 0.776 800 566 977 232 896 × 2 = 1 + 0.553 601 133 954 465 792;
  • 44) 0.553 601 133 954 465 792 × 2 = 1 + 0.107 202 267 908 931 584;
  • 45) 0.107 202 267 908 931 584 × 2 = 0 + 0.214 404 535 817 863 168;
  • 46) 0.214 404 535 817 863 168 × 2 = 0 + 0.428 809 071 635 726 336;
  • 47) 0.428 809 071 635 726 336 × 2 = 0 + 0.857 618 143 271 452 672;
  • 48) 0.857 618 143 271 452 672 × 2 = 1 + 0.715 236 286 542 905 344;
  • 49) 0.715 236 286 542 905 344 × 2 = 1 + 0.430 472 573 085 810 688;
  • 50) 0.430 472 573 085 810 688 × 2 = 0 + 0.860 945 146 171 621 376;
  • 51) 0.860 945 146 171 621 376 × 2 = 1 + 0.721 890 292 343 242 752;
  • 52) 0.721 890 292 343 242 752 × 2 = 1 + 0.443 780 584 686 485 504;
  • 53) 0.443 780 584 686 485 504 × 2 = 0 + 0.887 561 169 372 971 008;
  • 54) 0.887 561 169 372 971 008 × 2 = 1 + 0.775 122 338 745 942 016;
  • 55) 0.775 122 338 745 942 016 × 2 = 1 + 0.550 244 677 491 884 032;
  • 56) 0.550 244 677 491 884 032 × 2 = 1 + 0.100 489 354 983 768 064;
  • 57) 0.100 489 354 983 768 064 × 2 = 0 + 0.200 978 709 967 536 128;
  • 58) 0.200 978 709 967 536 128 × 2 = 0 + 0.401 957 419 935 072 256;
  • 59) 0.401 957 419 935 072 256 × 2 = 0 + 0.803 914 839 870 144 512;
  • 60) 0.803 914 839 870 144 512 × 2 = 1 + 0.607 829 679 740 289 024;
  • 61) 0.607 829 679 740 289 024 × 2 = 1 + 0.215 659 359 480 578 048;
  • 62) 0.215 659 359 480 578 048 × 2 = 0 + 0.431 318 718 961 156 096;
  • 63) 0.431 318 718 961 156 096 × 2 = 0 + 0.862 637 437 922 312 192;
  • 64) 0.862 637 437 922 312 192 × 2 = 1 + 0.725 274 875 844 624 384;
  • 65) 0.725 274 875 844 624 384 × 2 = 1 + 0.450 549 751 689 248 768;
  • 66) 0.450 549 751 689 248 768 × 2 = 0 + 0.901 099 503 378 497 536;
  • 67) 0.901 099 503 378 497 536 × 2 = 1 + 0.802 199 006 756 995 072;
  • 68) 0.802 199 006 756 995 072 × 2 = 1 + 0.604 398 013 513 990 144;
  • 69) 0.604 398 013 513 990 144 × 2 = 1 + 0.208 796 027 027 980 288;
  • 70) 0.208 796 027 027 980 288 × 2 = 0 + 0.417 592 054 055 960 576;
  • 71) 0.417 592 054 055 960 576 × 2 = 0 + 0.835 184 108 111 921 152;
  • 72) 0.835 184 108 111 921 152 × 2 = 1 + 0.670 368 216 223 842 304;
  • 73) 0.670 368 216 223 842 304 × 2 = 1 + 0.340 736 432 447 684 608;
  • 74) 0.340 736 432 447 684 608 × 2 = 0 + 0.681 472 864 895 369 216;
  • 75) 0.681 472 864 895 369 216 × 2 = 1 + 0.362 945 729 790 738 432;
  • 76) 0.362 945 729 790 738 432 × 2 = 0 + 0.725 891 459 581 476 864;
  • 77) 0.725 891 459 581 476 864 × 2 = 1 + 0.451 782 919 162 953 728;
  • 78) 0.451 782 919 162 953 728 × 2 = 0 + 0.903 565 838 325 907 456;
  • 79) 0.903 565 838 325 907 456 × 2 = 1 + 0.807 131 676 651 814 912;
  • 80) 0.807 131 676 651 814 912 × 2 = 1 + 0.614 263 353 303 629 824;
  • 81) 0.614 263 353 303 629 824 × 2 = 1 + 0.228 526 706 607 259 648;
  • 82) 0.228 526 706 607 259 648 × 2 = 0 + 0.457 053 413 214 519 296;
  • 83) 0.457 053 413 214 519 296 × 2 = 0 + 0.914 106 826 429 038 592;
  • 84) 0.914 106 826 429 038 592 × 2 = 1 + 0.828 213 652 858 077 184;
  • 85) 0.828 213 652 858 077 184 × 2 = 1 + 0.656 427 305 716 154 368;
  • 86) 0.656 427 305 716 154 368 × 2 = 1 + 0.312 854 611 432 308 736;
  • 87) 0.312 854 611 432 308 736 × 2 = 0 + 0.625 709 222 864 617 472;
  • 88) 0.625 709 222 864 617 472 × 2 = 1 + 0.251 418 445 729 234 944;
  • 89) 0.251 418 445 729 234 944 × 2 = 0 + 0.502 836 891 458 469 888;
  • 90) 0.502 836 891 458 469 888 × 2 = 1 + 0.005 673 782 916 939 776;
  • 91) 0.005 673 782 916 939 776 × 2 = 0 + 0.011 347 565 833 879 552;
  • 92) 0.011 347 565 833 879 552 × 2 = 0 + 0.022 695 131 667 759 104;
  • 93) 0.022 695 131 667 759 104 × 2 = 0 + 0.045 390 263 335 518 208;
  • 94) 0.045 390 263 335 518 208 × 2 = 0 + 0.090 780 526 671 036 416;
  • 95) 0.090 780 526 671 036 416 × 2 = 0 + 0.181 561 053 342 072 832;

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).


5. 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 176 624(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0111 0001 1001 1011 1001 1010 1011 1001 1101 0100 000(2)

6. Positive number before normalization:

0.000 000 000 000 176 624(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0111 0001 1001 1011 1001 1010 1011 1001 1101 0100 000(2)

7. Normalize the binary representation of the number.

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


0.000 000 000 000 176 624(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0111 0001 1001 1011 1001 1010 1011 1001 1101 0100 000(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0111 0001 1001 1011 1001 1010 1011 1001 1101 0100 000(2) × 20 =

1.1000 1101 1011 1000 1100 1101 1100 1101 0101 1100 1110 1010 0000(2) × 2-43


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

Mantissa (not normalized):
1.1000 1101 1011 1000 1100 1101 1100 1101 0101 1100 1110 1010 0000


9. Adjust the exponent.

Use the 11 bit excess/bias notation:


Exponent (adjusted) =

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

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

(-43 + 1 023)(10) =

980(10)


10. 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;
  • 980 ÷ 2 = 490 + 0;
  • 490 ÷ 2 = 245 + 0;
  • 245 ÷ 2 = 122 + 1;
  • 122 ÷ 2 = 61 + 0;
  • 61 ÷ 2 = 30 + 1;
  • 30 ÷ 2 = 15 + 0;
  • 15 ÷ 2 = 7 + 1;
  • 7 ÷ 2 = 3 + 1;
  • 3 ÷ 2 = 1 + 1;
  • 1 ÷ 2 = 0 + 1;

11. Construct the base 2 representation of the adjusted exponent.

Take all the remainders starting from the bottom of the list constructed above.


Exponent (adjusted) =

980(10) =

011 1101 0100(2)


12. 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. 1000 1101 1011 1000 1100 1101 1100 1101 0101 1100 1110 1010 0000 =

1000 1101 1011 1000 1100 1101 1100 1101 0101 1100 1110 1010 0000


13. The three elements that make up the number's 64 bit double precision IEEE 754 binary floating point representation:

Sign (1 bit) =
1 (a negative number)

Exponent (11 bits) =
011 1101 0100

Mantissa (52 bits) =
1000 1101 1011 1000 1100 1101 1100 1101 0101 1100 1110 1010 0000


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

1 - 011 1101 0100 - 1000 1101 1011 1000 1100 1101 1100 1101 0101 1100 1110 1010 0000

Share

» Convert decimal -0.000 000 000 000 176 601 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: Reputation: Bridge Between Company's Actions and Market Value. NotebookLM YouTube Video of 6.55 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