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

Convert decimal -0.000 000 000 000 176 602(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 602(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 602| = 0.000 000 000 000 176 602


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

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 602 × 2 = 0 + 0.000 000 000 000 353 204;
  • 2) 0.000 000 000 000 353 204 × 2 = 0 + 0.000 000 000 000 706 408;
  • 3) 0.000 000 000 000 706 408 × 2 = 0 + 0.000 000 000 001 412 816;
  • 4) 0.000 000 000 001 412 816 × 2 = 0 + 0.000 000 000 002 825 632;
  • 5) 0.000 000 000 002 825 632 × 2 = 0 + 0.000 000 000 005 651 264;
  • 6) 0.000 000 000 005 651 264 × 2 = 0 + 0.000 000 000 011 302 528;
  • 7) 0.000 000 000 011 302 528 × 2 = 0 + 0.000 000 000 022 605 056;
  • 8) 0.000 000 000 022 605 056 × 2 = 0 + 0.000 000 000 045 210 112;
  • 9) 0.000 000 000 045 210 112 × 2 = 0 + 0.000 000 000 090 420 224;
  • 10) 0.000 000 000 090 420 224 × 2 = 0 + 0.000 000 000 180 840 448;
  • 11) 0.000 000 000 180 840 448 × 2 = 0 + 0.000 000 000 361 680 896;
  • 12) 0.000 000 000 361 680 896 × 2 = 0 + 0.000 000 000 723 361 792;
  • 13) 0.000 000 000 723 361 792 × 2 = 0 + 0.000 000 001 446 723 584;
  • 14) 0.000 000 001 446 723 584 × 2 = 0 + 0.000 000 002 893 447 168;
  • 15) 0.000 000 002 893 447 168 × 2 = 0 + 0.000 000 005 786 894 336;
  • 16) 0.000 000 005 786 894 336 × 2 = 0 + 0.000 000 011 573 788 672;
  • 17) 0.000 000 011 573 788 672 × 2 = 0 + 0.000 000 023 147 577 344;
  • 18) 0.000 000 023 147 577 344 × 2 = 0 + 0.000 000 046 295 154 688;
  • 19) 0.000 000 046 295 154 688 × 2 = 0 + 0.000 000 092 590 309 376;
  • 20) 0.000 000 092 590 309 376 × 2 = 0 + 0.000 000 185 180 618 752;
  • 21) 0.000 000 185 180 618 752 × 2 = 0 + 0.000 000 370 361 237 504;
  • 22) 0.000 000 370 361 237 504 × 2 = 0 + 0.000 000 740 722 475 008;
  • 23) 0.000 000 740 722 475 008 × 2 = 0 + 0.000 001 481 444 950 016;
  • 24) 0.000 001 481 444 950 016 × 2 = 0 + 0.000 002 962 889 900 032;
  • 25) 0.000 002 962 889 900 032 × 2 = 0 + 0.000 005 925 779 800 064;
  • 26) 0.000 005 925 779 800 064 × 2 = 0 + 0.000 011 851 559 600 128;
  • 27) 0.000 011 851 559 600 128 × 2 = 0 + 0.000 023 703 119 200 256;
  • 28) 0.000 023 703 119 200 256 × 2 = 0 + 0.000 047 406 238 400 512;
  • 29) 0.000 047 406 238 400 512 × 2 = 0 + 0.000 094 812 476 801 024;
  • 30) 0.000 094 812 476 801 024 × 2 = 0 + 0.000 189 624 953 602 048;
  • 31) 0.000 189 624 953 602 048 × 2 = 0 + 0.000 379 249 907 204 096;
  • 32) 0.000 379 249 907 204 096 × 2 = 0 + 0.000 758 499 814 408 192;
  • 33) 0.000 758 499 814 408 192 × 2 = 0 + 0.001 516 999 628 816 384;
  • 34) 0.001 516 999 628 816 384 × 2 = 0 + 0.003 033 999 257 632 768;
  • 35) 0.003 033 999 257 632 768 × 2 = 0 + 0.006 067 998 515 265 536;
  • 36) 0.006 067 998 515 265 536 × 2 = 0 + 0.012 135 997 030 531 072;
  • 37) 0.012 135 997 030 531 072 × 2 = 0 + 0.024 271 994 061 062 144;
  • 38) 0.024 271 994 061 062 144 × 2 = 0 + 0.048 543 988 122 124 288;
  • 39) 0.048 543 988 122 124 288 × 2 = 0 + 0.097 087 976 244 248 576;
  • 40) 0.097 087 976 244 248 576 × 2 = 0 + 0.194 175 952 488 497 152;
  • 41) 0.194 175 952 488 497 152 × 2 = 0 + 0.388 351 904 976 994 304;
  • 42) 0.388 351 904 976 994 304 × 2 = 0 + 0.776 703 809 953 988 608;
  • 43) 0.776 703 809 953 988 608 × 2 = 1 + 0.553 407 619 907 977 216;
  • 44) 0.553 407 619 907 977 216 × 2 = 1 + 0.106 815 239 815 954 432;
  • 45) 0.106 815 239 815 954 432 × 2 = 0 + 0.213 630 479 631 908 864;
  • 46) 0.213 630 479 631 908 864 × 2 = 0 + 0.427 260 959 263 817 728;
  • 47) 0.427 260 959 263 817 728 × 2 = 0 + 0.854 521 918 527 635 456;
  • 48) 0.854 521 918 527 635 456 × 2 = 1 + 0.709 043 837 055 270 912;
  • 49) 0.709 043 837 055 270 912 × 2 = 1 + 0.418 087 674 110 541 824;
  • 50) 0.418 087 674 110 541 824 × 2 = 0 + 0.836 175 348 221 083 648;
  • 51) 0.836 175 348 221 083 648 × 2 = 1 + 0.672 350 696 442 167 296;
  • 52) 0.672 350 696 442 167 296 × 2 = 1 + 0.344 701 392 884 334 592;
  • 53) 0.344 701 392 884 334 592 × 2 = 0 + 0.689 402 785 768 669 184;
  • 54) 0.689 402 785 768 669 184 × 2 = 1 + 0.378 805 571 537 338 368;
  • 55) 0.378 805 571 537 338 368 × 2 = 0 + 0.757 611 143 074 676 736;
  • 56) 0.757 611 143 074 676 736 × 2 = 1 + 0.515 222 286 149 353 472;
  • 57) 0.515 222 286 149 353 472 × 2 = 1 + 0.030 444 572 298 706 944;
  • 58) 0.030 444 572 298 706 944 × 2 = 0 + 0.060 889 144 597 413 888;
  • 59) 0.060 889 144 597 413 888 × 2 = 0 + 0.121 778 289 194 827 776;
  • 60) 0.121 778 289 194 827 776 × 2 = 0 + 0.243 556 578 389 655 552;
  • 61) 0.243 556 578 389 655 552 × 2 = 0 + 0.487 113 156 779 311 104;
  • 62) 0.487 113 156 779 311 104 × 2 = 0 + 0.974 226 313 558 622 208;
  • 63) 0.974 226 313 558 622 208 × 2 = 1 + 0.948 452 627 117 244 416;
  • 64) 0.948 452 627 117 244 416 × 2 = 1 + 0.896 905 254 234 488 832;
  • 65) 0.896 905 254 234 488 832 × 2 = 1 + 0.793 810 508 468 977 664;
  • 66) 0.793 810 508 468 977 664 × 2 = 1 + 0.587 621 016 937 955 328;
  • 67) 0.587 621 016 937 955 328 × 2 = 1 + 0.175 242 033 875 910 656;
  • 68) 0.175 242 033 875 910 656 × 2 = 0 + 0.350 484 067 751 821 312;
  • 69) 0.350 484 067 751 821 312 × 2 = 0 + 0.700 968 135 503 642 624;
  • 70) 0.700 968 135 503 642 624 × 2 = 1 + 0.401 936 271 007 285 248;
  • 71) 0.401 936 271 007 285 248 × 2 = 0 + 0.803 872 542 014 570 496;
  • 72) 0.803 872 542 014 570 496 × 2 = 1 + 0.607 745 084 029 140 992;
  • 73) 0.607 745 084 029 140 992 × 2 = 1 + 0.215 490 168 058 281 984;
  • 74) 0.215 490 168 058 281 984 × 2 = 0 + 0.430 980 336 116 563 968;
  • 75) 0.430 980 336 116 563 968 × 2 = 0 + 0.861 960 672 233 127 936;
  • 76) 0.861 960 672 233 127 936 × 2 = 1 + 0.723 921 344 466 255 872;
  • 77) 0.723 921 344 466 255 872 × 2 = 1 + 0.447 842 688 932 511 744;
  • 78) 0.447 842 688 932 511 744 × 2 = 0 + 0.895 685 377 865 023 488;
  • 79) 0.895 685 377 865 023 488 × 2 = 1 + 0.791 370 755 730 046 976;
  • 80) 0.791 370 755 730 046 976 × 2 = 1 + 0.582 741 511 460 093 952;
  • 81) 0.582 741 511 460 093 952 × 2 = 1 + 0.165 483 022 920 187 904;
  • 82) 0.165 483 022 920 187 904 × 2 = 0 + 0.330 966 045 840 375 808;
  • 83) 0.330 966 045 840 375 808 × 2 = 0 + 0.661 932 091 680 751 616;
  • 84) 0.661 932 091 680 751 616 × 2 = 1 + 0.323 864 183 361 503 232;
  • 85) 0.323 864 183 361 503 232 × 2 = 0 + 0.647 728 366 723 006 464;
  • 86) 0.647 728 366 723 006 464 × 2 = 1 + 0.295 456 733 446 012 928;
  • 87) 0.295 456 733 446 012 928 × 2 = 0 + 0.590 913 466 892 025 856;
  • 88) 0.590 913 466 892 025 856 × 2 = 1 + 0.181 826 933 784 051 712;
  • 89) 0.181 826 933 784 051 712 × 2 = 0 + 0.363 653 867 568 103 424;
  • 90) 0.363 653 867 568 103 424 × 2 = 0 + 0.727 307 735 136 206 848;
  • 91) 0.727 307 735 136 206 848 × 2 = 1 + 0.454 615 470 272 413 696;
  • 92) 0.454 615 470 272 413 696 × 2 = 0 + 0.909 230 940 544 827 392;
  • 93) 0.909 230 940 544 827 392 × 2 = 1 + 0.818 461 881 089 654 784;
  • 94) 0.818 461 881 089 654 784 × 2 = 1 + 0.636 923 762 179 309 568;
  • 95) 0.636 923 762 179 309 568 × 2 = 1 + 0.273 847 524 358 619 136;

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 602(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0101 1000 0011 1110 0101 1001 1011 1001 0101 0010 111(2)

6. Positive number before normalization:

0.000 000 000 000 176 602(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0101 1000 0011 1110 0101 1001 1011 1001 0101 0010 111(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 602(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0101 1000 0011 1110 0101 1001 1011 1001 0101 0010 111(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0101 1000 0011 1110 0101 1001 1011 1001 0101 0010 111(2) × 20 =

1.1000 1101 1010 1100 0001 1111 0010 1100 1101 1100 1010 1001 0111(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 1010 1100 0001 1111 0010 1100 1101 1100 1010 1001 0111


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 1010 1100 0001 1111 0010 1100 1101 1100 1010 1001 0111 =

1000 1101 1010 1100 0001 1111 0010 1100 1101 1100 1010 1001 0111


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 1010 1100 0001 1111 0010 1100 1101 1100 1010 1001 0111


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

1 - 011 1101 0100 - 1000 1101 1010 1100 0001 1111 0010 1100 1101 1100 1010 1001 0111

Share

» Convert decimal -0.000 000 000 000 176 695 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: Pull vs. Push Leadership: The Invisible Power. NotebookLM YouTube Video of 11.31 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