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

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


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

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 562 × 2 = 0 + 0.000 000 000 000 353 124;
  • 2) 0.000 000 000 000 353 124 × 2 = 0 + 0.000 000 000 000 706 248;
  • 3) 0.000 000 000 000 706 248 × 2 = 0 + 0.000 000 000 001 412 496;
  • 4) 0.000 000 000 001 412 496 × 2 = 0 + 0.000 000 000 002 824 992;
  • 5) 0.000 000 000 002 824 992 × 2 = 0 + 0.000 000 000 005 649 984;
  • 6) 0.000 000 000 005 649 984 × 2 = 0 + 0.000 000 000 011 299 968;
  • 7) 0.000 000 000 011 299 968 × 2 = 0 + 0.000 000 000 022 599 936;
  • 8) 0.000 000 000 022 599 936 × 2 = 0 + 0.000 000 000 045 199 872;
  • 9) 0.000 000 000 045 199 872 × 2 = 0 + 0.000 000 000 090 399 744;
  • 10) 0.000 000 000 090 399 744 × 2 = 0 + 0.000 000 000 180 799 488;
  • 11) 0.000 000 000 180 799 488 × 2 = 0 + 0.000 000 000 361 598 976;
  • 12) 0.000 000 000 361 598 976 × 2 = 0 + 0.000 000 000 723 197 952;
  • 13) 0.000 000 000 723 197 952 × 2 = 0 + 0.000 000 001 446 395 904;
  • 14) 0.000 000 001 446 395 904 × 2 = 0 + 0.000 000 002 892 791 808;
  • 15) 0.000 000 002 892 791 808 × 2 = 0 + 0.000 000 005 785 583 616;
  • 16) 0.000 000 005 785 583 616 × 2 = 0 + 0.000 000 011 571 167 232;
  • 17) 0.000 000 011 571 167 232 × 2 = 0 + 0.000 000 023 142 334 464;
  • 18) 0.000 000 023 142 334 464 × 2 = 0 + 0.000 000 046 284 668 928;
  • 19) 0.000 000 046 284 668 928 × 2 = 0 + 0.000 000 092 569 337 856;
  • 20) 0.000 000 092 569 337 856 × 2 = 0 + 0.000 000 185 138 675 712;
  • 21) 0.000 000 185 138 675 712 × 2 = 0 + 0.000 000 370 277 351 424;
  • 22) 0.000 000 370 277 351 424 × 2 = 0 + 0.000 000 740 554 702 848;
  • 23) 0.000 000 740 554 702 848 × 2 = 0 + 0.000 001 481 109 405 696;
  • 24) 0.000 001 481 109 405 696 × 2 = 0 + 0.000 002 962 218 811 392;
  • 25) 0.000 002 962 218 811 392 × 2 = 0 + 0.000 005 924 437 622 784;
  • 26) 0.000 005 924 437 622 784 × 2 = 0 + 0.000 011 848 875 245 568;
  • 27) 0.000 011 848 875 245 568 × 2 = 0 + 0.000 023 697 750 491 136;
  • 28) 0.000 023 697 750 491 136 × 2 = 0 + 0.000 047 395 500 982 272;
  • 29) 0.000 047 395 500 982 272 × 2 = 0 + 0.000 094 791 001 964 544;
  • 30) 0.000 094 791 001 964 544 × 2 = 0 + 0.000 189 582 003 929 088;
  • 31) 0.000 189 582 003 929 088 × 2 = 0 + 0.000 379 164 007 858 176;
  • 32) 0.000 379 164 007 858 176 × 2 = 0 + 0.000 758 328 015 716 352;
  • 33) 0.000 758 328 015 716 352 × 2 = 0 + 0.001 516 656 031 432 704;
  • 34) 0.001 516 656 031 432 704 × 2 = 0 + 0.003 033 312 062 865 408;
  • 35) 0.003 033 312 062 865 408 × 2 = 0 + 0.006 066 624 125 730 816;
  • 36) 0.006 066 624 125 730 816 × 2 = 0 + 0.012 133 248 251 461 632;
  • 37) 0.012 133 248 251 461 632 × 2 = 0 + 0.024 266 496 502 923 264;
  • 38) 0.024 266 496 502 923 264 × 2 = 0 + 0.048 532 993 005 846 528;
  • 39) 0.048 532 993 005 846 528 × 2 = 0 + 0.097 065 986 011 693 056;
  • 40) 0.097 065 986 011 693 056 × 2 = 0 + 0.194 131 972 023 386 112;
  • 41) 0.194 131 972 023 386 112 × 2 = 0 + 0.388 263 944 046 772 224;
  • 42) 0.388 263 944 046 772 224 × 2 = 0 + 0.776 527 888 093 544 448;
  • 43) 0.776 527 888 093 544 448 × 2 = 1 + 0.553 055 776 187 088 896;
  • 44) 0.553 055 776 187 088 896 × 2 = 1 + 0.106 111 552 374 177 792;
  • 45) 0.106 111 552 374 177 792 × 2 = 0 + 0.212 223 104 748 355 584;
  • 46) 0.212 223 104 748 355 584 × 2 = 0 + 0.424 446 209 496 711 168;
  • 47) 0.424 446 209 496 711 168 × 2 = 0 + 0.848 892 418 993 422 336;
  • 48) 0.848 892 418 993 422 336 × 2 = 1 + 0.697 784 837 986 844 672;
  • 49) 0.697 784 837 986 844 672 × 2 = 1 + 0.395 569 675 973 689 344;
  • 50) 0.395 569 675 973 689 344 × 2 = 0 + 0.791 139 351 947 378 688;
  • 51) 0.791 139 351 947 378 688 × 2 = 1 + 0.582 278 703 894 757 376;
  • 52) 0.582 278 703 894 757 376 × 2 = 1 + 0.164 557 407 789 514 752;
  • 53) 0.164 557 407 789 514 752 × 2 = 0 + 0.329 114 815 579 029 504;
  • 54) 0.329 114 815 579 029 504 × 2 = 0 + 0.658 229 631 158 059 008;
  • 55) 0.658 229 631 158 059 008 × 2 = 1 + 0.316 459 262 316 118 016;
  • 56) 0.316 459 262 316 118 016 × 2 = 0 + 0.632 918 524 632 236 032;
  • 57) 0.632 918 524 632 236 032 × 2 = 1 + 0.265 837 049 264 472 064;
  • 58) 0.265 837 049 264 472 064 × 2 = 0 + 0.531 674 098 528 944 128;
  • 59) 0.531 674 098 528 944 128 × 2 = 1 + 0.063 348 197 057 888 256;
  • 60) 0.063 348 197 057 888 256 × 2 = 0 + 0.126 696 394 115 776 512;
  • 61) 0.126 696 394 115 776 512 × 2 = 0 + 0.253 392 788 231 553 024;
  • 62) 0.253 392 788 231 553 024 × 2 = 0 + 0.506 785 576 463 106 048;
  • 63) 0.506 785 576 463 106 048 × 2 = 1 + 0.013 571 152 926 212 096;
  • 64) 0.013 571 152 926 212 096 × 2 = 0 + 0.027 142 305 852 424 192;
  • 65) 0.027 142 305 852 424 192 × 2 = 0 + 0.054 284 611 704 848 384;
  • 66) 0.054 284 611 704 848 384 × 2 = 0 + 0.108 569 223 409 696 768;
  • 67) 0.108 569 223 409 696 768 × 2 = 0 + 0.217 138 446 819 393 536;
  • 68) 0.217 138 446 819 393 536 × 2 = 0 + 0.434 276 893 638 787 072;
  • 69) 0.434 276 893 638 787 072 × 2 = 0 + 0.868 553 787 277 574 144;
  • 70) 0.868 553 787 277 574 144 × 2 = 1 + 0.737 107 574 555 148 288;
  • 71) 0.737 107 574 555 148 288 × 2 = 1 + 0.474 215 149 110 296 576;
  • 72) 0.474 215 149 110 296 576 × 2 = 0 + 0.948 430 298 220 593 152;
  • 73) 0.948 430 298 220 593 152 × 2 = 1 + 0.896 860 596 441 186 304;
  • 74) 0.896 860 596 441 186 304 × 2 = 1 + 0.793 721 192 882 372 608;
  • 75) 0.793 721 192 882 372 608 × 2 = 1 + 0.587 442 385 764 745 216;
  • 76) 0.587 442 385 764 745 216 × 2 = 1 + 0.174 884 771 529 490 432;
  • 77) 0.174 884 771 529 490 432 × 2 = 0 + 0.349 769 543 058 980 864;
  • 78) 0.349 769 543 058 980 864 × 2 = 0 + 0.699 539 086 117 961 728;
  • 79) 0.699 539 086 117 961 728 × 2 = 1 + 0.399 078 172 235 923 456;
  • 80) 0.399 078 172 235 923 456 × 2 = 0 + 0.798 156 344 471 846 912;
  • 81) 0.798 156 344 471 846 912 × 2 = 1 + 0.596 312 688 943 693 824;
  • 82) 0.596 312 688 943 693 824 × 2 = 1 + 0.192 625 377 887 387 648;
  • 83) 0.192 625 377 887 387 648 × 2 = 0 + 0.385 250 755 774 775 296;
  • 84) 0.385 250 755 774 775 296 × 2 = 0 + 0.770 501 511 549 550 592;
  • 85) 0.770 501 511 549 550 592 × 2 = 1 + 0.541 003 023 099 101 184;
  • 86) 0.541 003 023 099 101 184 × 2 = 1 + 0.082 006 046 198 202 368;
  • 87) 0.082 006 046 198 202 368 × 2 = 0 + 0.164 012 092 396 404 736;
  • 88) 0.164 012 092 396 404 736 × 2 = 0 + 0.328 024 184 792 809 472;
  • 89) 0.328 024 184 792 809 472 × 2 = 0 + 0.656 048 369 585 618 944;
  • 90) 0.656 048 369 585 618 944 × 2 = 1 + 0.312 096 739 171 237 888;
  • 91) 0.312 096 739 171 237 888 × 2 = 0 + 0.624 193 478 342 475 776;
  • 92) 0.624 193 478 342 475 776 × 2 = 1 + 0.248 386 956 684 951 552;
  • 93) 0.248 386 956 684 951 552 × 2 = 0 + 0.496 773 913 369 903 104;
  • 94) 0.496 773 913 369 903 104 × 2 = 0 + 0.993 547 826 739 806 208;
  • 95) 0.993 547 826 739 806 208 × 2 = 1 + 0.987 095 653 479 612 416;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 1010 0010 0000 0110 1111 0010 1100 1100 0101 001(2)

6. Positive number before normalization:

0.000 000 000 000 176 562(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 1010 0010 0000 0110 1111 0010 1100 1100 0101 001(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 562(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 1010 0010 0000 0110 1111 0010 1100 1100 0101 001(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 1010 0010 0000 0110 1111 0010 1100 1100 0101 001(2) × 20 =

1.1000 1101 1001 0101 0001 0000 0011 0111 1001 0110 0110 0010 1001(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 1001 0101 0001 0000 0011 0111 1001 0110 0110 0010 1001


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 1001 0101 0001 0000 0011 0111 1001 0110 0110 0010 1001 =

1000 1101 1001 0101 0001 0000 0011 0111 1001 0110 0110 0010 1001


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 1001 0101 0001 0000 0011 0111 1001 0110 0110 0010 1001


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

1 - 011 1101 0100 - 1000 1101 1001 0101 0001 0000 0011 0111 1001 0110 0110 0010 1001

Share

» Convert decimal -0.000 000 000 000 176 587 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