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

Convert decimal -0.000 000 000 000 176 555 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 555 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 555 5| = 0.000 000 000 000 176 555 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 555 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 555 5 × 2 = 0 + 0.000 000 000 000 353 111;
  • 2) 0.000 000 000 000 353 111 × 2 = 0 + 0.000 000 000 000 706 222;
  • 3) 0.000 000 000 000 706 222 × 2 = 0 + 0.000 000 000 001 412 444;
  • 4) 0.000 000 000 001 412 444 × 2 = 0 + 0.000 000 000 002 824 888;
  • 5) 0.000 000 000 002 824 888 × 2 = 0 + 0.000 000 000 005 649 776;
  • 6) 0.000 000 000 005 649 776 × 2 = 0 + 0.000 000 000 011 299 552;
  • 7) 0.000 000 000 011 299 552 × 2 = 0 + 0.000 000 000 022 599 104;
  • 8) 0.000 000 000 022 599 104 × 2 = 0 + 0.000 000 000 045 198 208;
  • 9) 0.000 000 000 045 198 208 × 2 = 0 + 0.000 000 000 090 396 416;
  • 10) 0.000 000 000 090 396 416 × 2 = 0 + 0.000 000 000 180 792 832;
  • 11) 0.000 000 000 180 792 832 × 2 = 0 + 0.000 000 000 361 585 664;
  • 12) 0.000 000 000 361 585 664 × 2 = 0 + 0.000 000 000 723 171 328;
  • 13) 0.000 000 000 723 171 328 × 2 = 0 + 0.000 000 001 446 342 656;
  • 14) 0.000 000 001 446 342 656 × 2 = 0 + 0.000 000 002 892 685 312;
  • 15) 0.000 000 002 892 685 312 × 2 = 0 + 0.000 000 005 785 370 624;
  • 16) 0.000 000 005 785 370 624 × 2 = 0 + 0.000 000 011 570 741 248;
  • 17) 0.000 000 011 570 741 248 × 2 = 0 + 0.000 000 023 141 482 496;
  • 18) 0.000 000 023 141 482 496 × 2 = 0 + 0.000 000 046 282 964 992;
  • 19) 0.000 000 046 282 964 992 × 2 = 0 + 0.000 000 092 565 929 984;
  • 20) 0.000 000 092 565 929 984 × 2 = 0 + 0.000 000 185 131 859 968;
  • 21) 0.000 000 185 131 859 968 × 2 = 0 + 0.000 000 370 263 719 936;
  • 22) 0.000 000 370 263 719 936 × 2 = 0 + 0.000 000 740 527 439 872;
  • 23) 0.000 000 740 527 439 872 × 2 = 0 + 0.000 001 481 054 879 744;
  • 24) 0.000 001 481 054 879 744 × 2 = 0 + 0.000 002 962 109 759 488;
  • 25) 0.000 002 962 109 759 488 × 2 = 0 + 0.000 005 924 219 518 976;
  • 26) 0.000 005 924 219 518 976 × 2 = 0 + 0.000 011 848 439 037 952;
  • 27) 0.000 011 848 439 037 952 × 2 = 0 + 0.000 023 696 878 075 904;
  • 28) 0.000 023 696 878 075 904 × 2 = 0 + 0.000 047 393 756 151 808;
  • 29) 0.000 047 393 756 151 808 × 2 = 0 + 0.000 094 787 512 303 616;
  • 30) 0.000 094 787 512 303 616 × 2 = 0 + 0.000 189 575 024 607 232;
  • 31) 0.000 189 575 024 607 232 × 2 = 0 + 0.000 379 150 049 214 464;
  • 32) 0.000 379 150 049 214 464 × 2 = 0 + 0.000 758 300 098 428 928;
  • 33) 0.000 758 300 098 428 928 × 2 = 0 + 0.001 516 600 196 857 856;
  • 34) 0.001 516 600 196 857 856 × 2 = 0 + 0.003 033 200 393 715 712;
  • 35) 0.003 033 200 393 715 712 × 2 = 0 + 0.006 066 400 787 431 424;
  • 36) 0.006 066 400 787 431 424 × 2 = 0 + 0.012 132 801 574 862 848;
  • 37) 0.012 132 801 574 862 848 × 2 = 0 + 0.024 265 603 149 725 696;
  • 38) 0.024 265 603 149 725 696 × 2 = 0 + 0.048 531 206 299 451 392;
  • 39) 0.048 531 206 299 451 392 × 2 = 0 + 0.097 062 412 598 902 784;
  • 40) 0.097 062 412 598 902 784 × 2 = 0 + 0.194 124 825 197 805 568;
  • 41) 0.194 124 825 197 805 568 × 2 = 0 + 0.388 249 650 395 611 136;
  • 42) 0.388 249 650 395 611 136 × 2 = 0 + 0.776 499 300 791 222 272;
  • 43) 0.776 499 300 791 222 272 × 2 = 1 + 0.552 998 601 582 444 544;
  • 44) 0.552 998 601 582 444 544 × 2 = 1 + 0.105 997 203 164 889 088;
  • 45) 0.105 997 203 164 889 088 × 2 = 0 + 0.211 994 406 329 778 176;
  • 46) 0.211 994 406 329 778 176 × 2 = 0 + 0.423 988 812 659 556 352;
  • 47) 0.423 988 812 659 556 352 × 2 = 0 + 0.847 977 625 319 112 704;
  • 48) 0.847 977 625 319 112 704 × 2 = 1 + 0.695 955 250 638 225 408;
  • 49) 0.695 955 250 638 225 408 × 2 = 1 + 0.391 910 501 276 450 816;
  • 50) 0.391 910 501 276 450 816 × 2 = 0 + 0.783 821 002 552 901 632;
  • 51) 0.783 821 002 552 901 632 × 2 = 1 + 0.567 642 005 105 803 264;
  • 52) 0.567 642 005 105 803 264 × 2 = 1 + 0.135 284 010 211 606 528;
  • 53) 0.135 284 010 211 606 528 × 2 = 0 + 0.270 568 020 423 213 056;
  • 54) 0.270 568 020 423 213 056 × 2 = 0 + 0.541 136 040 846 426 112;
  • 55) 0.541 136 040 846 426 112 × 2 = 1 + 0.082 272 081 692 852 224;
  • 56) 0.082 272 081 692 852 224 × 2 = 0 + 0.164 544 163 385 704 448;
  • 57) 0.164 544 163 385 704 448 × 2 = 0 + 0.329 088 326 771 408 896;
  • 58) 0.329 088 326 771 408 896 × 2 = 0 + 0.658 176 653 542 817 792;
  • 59) 0.658 176 653 542 817 792 × 2 = 1 + 0.316 353 307 085 635 584;
  • 60) 0.316 353 307 085 635 584 × 2 = 0 + 0.632 706 614 171 271 168;
  • 61) 0.632 706 614 171 271 168 × 2 = 1 + 0.265 413 228 342 542 336;
  • 62) 0.265 413 228 342 542 336 × 2 = 0 + 0.530 826 456 685 084 672;
  • 63) 0.530 826 456 685 084 672 × 2 = 1 + 0.061 652 913 370 169 344;
  • 64) 0.061 652 913 370 169 344 × 2 = 0 + 0.123 305 826 740 338 688;
  • 65) 0.123 305 826 740 338 688 × 2 = 0 + 0.246 611 653 480 677 376;
  • 66) 0.246 611 653 480 677 376 × 2 = 0 + 0.493 223 306 961 354 752;
  • 67) 0.493 223 306 961 354 752 × 2 = 0 + 0.986 446 613 922 709 504;
  • 68) 0.986 446 613 922 709 504 × 2 = 1 + 0.972 893 227 845 419 008;
  • 69) 0.972 893 227 845 419 008 × 2 = 1 + 0.945 786 455 690 838 016;
  • 70) 0.945 786 455 690 838 016 × 2 = 1 + 0.891 572 911 381 676 032;
  • 71) 0.891 572 911 381 676 032 × 2 = 1 + 0.783 145 822 763 352 064;
  • 72) 0.783 145 822 763 352 064 × 2 = 1 + 0.566 291 645 526 704 128;
  • 73) 0.566 291 645 526 704 128 × 2 = 1 + 0.132 583 291 053 408 256;
  • 74) 0.132 583 291 053 408 256 × 2 = 0 + 0.265 166 582 106 816 512;
  • 75) 0.265 166 582 106 816 512 × 2 = 0 + 0.530 333 164 213 633 024;
  • 76) 0.530 333 164 213 633 024 × 2 = 1 + 0.060 666 328 427 266 048;
  • 77) 0.060 666 328 427 266 048 × 2 = 0 + 0.121 332 656 854 532 096;
  • 78) 0.121 332 656 854 532 096 × 2 = 0 + 0.242 665 313 709 064 192;
  • 79) 0.242 665 313 709 064 192 × 2 = 0 + 0.485 330 627 418 128 384;
  • 80) 0.485 330 627 418 128 384 × 2 = 0 + 0.970 661 254 836 256 768;
  • 81) 0.970 661 254 836 256 768 × 2 = 1 + 0.941 322 509 672 513 536;
  • 82) 0.941 322 509 672 513 536 × 2 = 1 + 0.882 645 019 345 027 072;
  • 83) 0.882 645 019 345 027 072 × 2 = 1 + 0.765 290 038 690 054 144;
  • 84) 0.765 290 038 690 054 144 × 2 = 1 + 0.530 580 077 380 108 288;
  • 85) 0.530 580 077 380 108 288 × 2 = 1 + 0.061 160 154 760 216 576;
  • 86) 0.061 160 154 760 216 576 × 2 = 0 + 0.122 320 309 520 433 152;
  • 87) 0.122 320 309 520 433 152 × 2 = 0 + 0.244 640 619 040 866 304;
  • 88) 0.244 640 619 040 866 304 × 2 = 0 + 0.489 281 238 081 732 608;
  • 89) 0.489 281 238 081 732 608 × 2 = 0 + 0.978 562 476 163 465 216;
  • 90) 0.978 562 476 163 465 216 × 2 = 1 + 0.957 124 952 326 930 432;
  • 91) 0.957 124 952 326 930 432 × 2 = 1 + 0.914 249 904 653 860 864;
  • 92) 0.914 249 904 653 860 864 × 2 = 1 + 0.828 499 809 307 721 728;
  • 93) 0.828 499 809 307 721 728 × 2 = 1 + 0.656 999 618 615 443 456;
  • 94) 0.656 999 618 615 443 456 × 2 = 1 + 0.313 999 237 230 886 912;
  • 95) 0.313 999 237 230 886 912 × 2 = 0 + 0.627 998 474 461 773 824;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 0010 1010 0001 1111 1001 0000 1111 1000 0111 110(2)

6. Positive number before normalization:

0.000 000 000 000 176 555 5(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 0010 1010 0001 1111 1001 0000 1111 1000 0111 110(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 555 5(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 0010 1010 0001 1111 1001 0000 1111 1000 0111 110(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0010 0010 1010 0001 1111 1001 0000 1111 1000 0111 110(2) × 20 =

1.1000 1101 1001 0001 0101 0000 1111 1100 1000 0111 1100 0011 1110(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 0101 0000 1111 1100 1000 0111 1100 0011 1110


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 0101 0000 1111 1100 1000 0111 1100 0011 1110 =

1000 1101 1001 0001 0101 0000 1111 1100 1000 0111 1100 0011 1110


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 0101 0000 1111 1100 1000 0111 1100 0011 1110


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

1 - 011 1101 0100 - 1000 1101 1001 0001 0101 0000 1111 1100 1000 0111 1100 0011 1110

Share

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