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

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


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 556 5.

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 556 5 × 2 = 0 + 0.000 000 000 000 353 113;
  • 2) 0.000 000 000 000 353 113 × 2 = 0 + 0.000 000 000 000 706 226;
  • 3) 0.000 000 000 000 706 226 × 2 = 0 + 0.000 000 000 001 412 452;
  • 4) 0.000 000 000 001 412 452 × 2 = 0 + 0.000 000 000 002 824 904;
  • 5) 0.000 000 000 002 824 904 × 2 = 0 + 0.000 000 000 005 649 808;
  • 6) 0.000 000 000 005 649 808 × 2 = 0 + 0.000 000 000 011 299 616;
  • 7) 0.000 000 000 011 299 616 × 2 = 0 + 0.000 000 000 022 599 232;
  • 8) 0.000 000 000 022 599 232 × 2 = 0 + 0.000 000 000 045 198 464;
  • 9) 0.000 000 000 045 198 464 × 2 = 0 + 0.000 000 000 090 396 928;
  • 10) 0.000 000 000 090 396 928 × 2 = 0 + 0.000 000 000 180 793 856;
  • 11) 0.000 000 000 180 793 856 × 2 = 0 + 0.000 000 000 361 587 712;
  • 12) 0.000 000 000 361 587 712 × 2 = 0 + 0.000 000 000 723 175 424;
  • 13) 0.000 000 000 723 175 424 × 2 = 0 + 0.000 000 001 446 350 848;
  • 14) 0.000 000 001 446 350 848 × 2 = 0 + 0.000 000 002 892 701 696;
  • 15) 0.000 000 002 892 701 696 × 2 = 0 + 0.000 000 005 785 403 392;
  • 16) 0.000 000 005 785 403 392 × 2 = 0 + 0.000 000 011 570 806 784;
  • 17) 0.000 000 011 570 806 784 × 2 = 0 + 0.000 000 023 141 613 568;
  • 18) 0.000 000 023 141 613 568 × 2 = 0 + 0.000 000 046 283 227 136;
  • 19) 0.000 000 046 283 227 136 × 2 = 0 + 0.000 000 092 566 454 272;
  • 20) 0.000 000 092 566 454 272 × 2 = 0 + 0.000 000 185 132 908 544;
  • 21) 0.000 000 185 132 908 544 × 2 = 0 + 0.000 000 370 265 817 088;
  • 22) 0.000 000 370 265 817 088 × 2 = 0 + 0.000 000 740 531 634 176;
  • 23) 0.000 000 740 531 634 176 × 2 = 0 + 0.000 001 481 063 268 352;
  • 24) 0.000 001 481 063 268 352 × 2 = 0 + 0.000 002 962 126 536 704;
  • 25) 0.000 002 962 126 536 704 × 2 = 0 + 0.000 005 924 253 073 408;
  • 26) 0.000 005 924 253 073 408 × 2 = 0 + 0.000 011 848 506 146 816;
  • 27) 0.000 011 848 506 146 816 × 2 = 0 + 0.000 023 697 012 293 632;
  • 28) 0.000 023 697 012 293 632 × 2 = 0 + 0.000 047 394 024 587 264;
  • 29) 0.000 047 394 024 587 264 × 2 = 0 + 0.000 094 788 049 174 528;
  • 30) 0.000 094 788 049 174 528 × 2 = 0 + 0.000 189 576 098 349 056;
  • 31) 0.000 189 576 098 349 056 × 2 = 0 + 0.000 379 152 196 698 112;
  • 32) 0.000 379 152 196 698 112 × 2 = 0 + 0.000 758 304 393 396 224;
  • 33) 0.000 758 304 393 396 224 × 2 = 0 + 0.001 516 608 786 792 448;
  • 34) 0.001 516 608 786 792 448 × 2 = 0 + 0.003 033 217 573 584 896;
  • 35) 0.003 033 217 573 584 896 × 2 = 0 + 0.006 066 435 147 169 792;
  • 36) 0.006 066 435 147 169 792 × 2 = 0 + 0.012 132 870 294 339 584;
  • 37) 0.012 132 870 294 339 584 × 2 = 0 + 0.024 265 740 588 679 168;
  • 38) 0.024 265 740 588 679 168 × 2 = 0 + 0.048 531 481 177 358 336;
  • 39) 0.048 531 481 177 358 336 × 2 = 0 + 0.097 062 962 354 716 672;
  • 40) 0.097 062 962 354 716 672 × 2 = 0 + 0.194 125 924 709 433 344;
  • 41) 0.194 125 924 709 433 344 × 2 = 0 + 0.388 251 849 418 866 688;
  • 42) 0.388 251 849 418 866 688 × 2 = 0 + 0.776 503 698 837 733 376;
  • 43) 0.776 503 698 837 733 376 × 2 = 1 + 0.553 007 397 675 466 752;
  • 44) 0.553 007 397 675 466 752 × 2 = 1 + 0.106 014 795 350 933 504;
  • 45) 0.106 014 795 350 933 504 × 2 = 0 + 0.212 029 590 701 867 008;
  • 46) 0.212 029 590 701 867 008 × 2 = 0 + 0.424 059 181 403 734 016;
  • 47) 0.424 059 181 403 734 016 × 2 = 0 + 0.848 118 362 807 468 032;
  • 48) 0.848 118 362 807 468 032 × 2 = 1 + 0.696 236 725 614 936 064;
  • 49) 0.696 236 725 614 936 064 × 2 = 1 + 0.392 473 451 229 872 128;
  • 50) 0.392 473 451 229 872 128 × 2 = 0 + 0.784 946 902 459 744 256;
  • 51) 0.784 946 902 459 744 256 × 2 = 1 + 0.569 893 804 919 488 512;
  • 52) 0.569 893 804 919 488 512 × 2 = 1 + 0.139 787 609 838 977 024;
  • 53) 0.139 787 609 838 977 024 × 2 = 0 + 0.279 575 219 677 954 048;
  • 54) 0.279 575 219 677 954 048 × 2 = 0 + 0.559 150 439 355 908 096;
  • 55) 0.559 150 439 355 908 096 × 2 = 1 + 0.118 300 878 711 816 192;
  • 56) 0.118 300 878 711 816 192 × 2 = 0 + 0.236 601 757 423 632 384;
  • 57) 0.236 601 757 423 632 384 × 2 = 0 + 0.473 203 514 847 264 768;
  • 58) 0.473 203 514 847 264 768 × 2 = 0 + 0.946 407 029 694 529 536;
  • 59) 0.946 407 029 694 529 536 × 2 = 1 + 0.892 814 059 389 059 072;
  • 60) 0.892 814 059 389 059 072 × 2 = 1 + 0.785 628 118 778 118 144;
  • 61) 0.785 628 118 778 118 144 × 2 = 1 + 0.571 256 237 556 236 288;
  • 62) 0.571 256 237 556 236 288 × 2 = 1 + 0.142 512 475 112 472 576;
  • 63) 0.142 512 475 112 472 576 × 2 = 0 + 0.285 024 950 224 945 152;
  • 64) 0.285 024 950 224 945 152 × 2 = 0 + 0.570 049 900 449 890 304;
  • 65) 0.570 049 900 449 890 304 × 2 = 1 + 0.140 099 800 899 780 608;
  • 66) 0.140 099 800 899 780 608 × 2 = 0 + 0.280 199 601 799 561 216;
  • 67) 0.280 199 601 799 561 216 × 2 = 0 + 0.560 399 203 599 122 432;
  • 68) 0.560 399 203 599 122 432 × 2 = 1 + 0.120 798 407 198 244 864;
  • 69) 0.120 798 407 198 244 864 × 2 = 0 + 0.241 596 814 396 489 728;
  • 70) 0.241 596 814 396 489 728 × 2 = 0 + 0.483 193 628 792 979 456;
  • 71) 0.483 193 628 792 979 456 × 2 = 0 + 0.966 387 257 585 958 912;
  • 72) 0.966 387 257 585 958 912 × 2 = 1 + 0.932 774 515 171 917 824;
  • 73) 0.932 774 515 171 917 824 × 2 = 1 + 0.865 549 030 343 835 648;
  • 74) 0.865 549 030 343 835 648 × 2 = 1 + 0.731 098 060 687 671 296;
  • 75) 0.731 098 060 687 671 296 × 2 = 1 + 0.462 196 121 375 342 592;
  • 76) 0.462 196 121 375 342 592 × 2 = 0 + 0.924 392 242 750 685 184;
  • 77) 0.924 392 242 750 685 184 × 2 = 1 + 0.848 784 485 501 370 368;
  • 78) 0.848 784 485 501 370 368 × 2 = 1 + 0.697 568 971 002 740 736;
  • 79) 0.697 568 971 002 740 736 × 2 = 1 + 0.395 137 942 005 481 472;
  • 80) 0.395 137 942 005 481 472 × 2 = 0 + 0.790 275 884 010 962 944;
  • 81) 0.790 275 884 010 962 944 × 2 = 1 + 0.580 551 768 021 925 888;
  • 82) 0.580 551 768 021 925 888 × 2 = 1 + 0.161 103 536 043 851 776;
  • 83) 0.161 103 536 043 851 776 × 2 = 0 + 0.322 207 072 087 703 552;
  • 84) 0.322 207 072 087 703 552 × 2 = 0 + 0.644 414 144 175 407 104;
  • 85) 0.644 414 144 175 407 104 × 2 = 1 + 0.288 828 288 350 814 208;
  • 86) 0.288 828 288 350 814 208 × 2 = 0 + 0.577 656 576 701 628 416;
  • 87) 0.577 656 576 701 628 416 × 2 = 1 + 0.155 313 153 403 256 832;
  • 88) 0.155 313 153 403 256 832 × 2 = 0 + 0.310 626 306 806 513 664;
  • 89) 0.310 626 306 806 513 664 × 2 = 0 + 0.621 252 613 613 027 328;
  • 90) 0.621 252 613 613 027 328 × 2 = 1 + 0.242 505 227 226 054 656;
  • 91) 0.242 505 227 226 054 656 × 2 = 0 + 0.485 010 454 452 109 312;
  • 92) 0.485 010 454 452 109 312 × 2 = 0 + 0.970 020 908 904 218 624;
  • 93) 0.970 020 908 904 218 624 × 2 = 1 + 0.940 041 817 808 437 248;
  • 94) 0.940 041 817 808 437 248 × 2 = 1 + 0.880 083 635 616 874 496;
  • 95) 0.880 083 635 616 874 496 × 2 = 1 + 0.760 167 271 233 748 992;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 0011 1100 1001 0001 1110 1110 1100 1010 0100 111(2)

6. Positive number before normalization:

0.000 000 000 000 176 556 5(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 0011 1100 1001 0001 1110 1110 1100 1010 0100 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 556 5(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 0011 1100 1001 0001 1110 1110 1100 1010 0100 111(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 0011 1100 1001 0001 1110 1110 1100 1010 0100 111(2) × 20 =

1.1000 1101 1001 0001 1110 0100 1000 1111 0111 0110 0101 0010 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 1001 0001 1110 0100 1000 1111 0111 0110 0101 0010 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 1001 0001 1110 0100 1000 1111 0111 0110 0101 0010 0111 =

1000 1101 1001 0001 1110 0100 1000 1111 0111 0110 0101 0010 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 1001 0001 1110 0100 1000 1111 0111 0110 0101 0010 0111


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

1 - 011 1101 0100 - 1000 1101 1001 0001 1110 0100 1000 1111 0111 0110 0101 0010 0111

Share

» Convert decimal -0.000 000 000 000 176 557 9 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: Magnetic Leadership: The Invisible Power of the Pull. 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