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

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


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

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 587 × 2 = 0 + 0.000 000 000 000 353 174;
  • 2) 0.000 000 000 000 353 174 × 2 = 0 + 0.000 000 000 000 706 348;
  • 3) 0.000 000 000 000 706 348 × 2 = 0 + 0.000 000 000 001 412 696;
  • 4) 0.000 000 000 001 412 696 × 2 = 0 + 0.000 000 000 002 825 392;
  • 5) 0.000 000 000 002 825 392 × 2 = 0 + 0.000 000 000 005 650 784;
  • 6) 0.000 000 000 005 650 784 × 2 = 0 + 0.000 000 000 011 301 568;
  • 7) 0.000 000 000 011 301 568 × 2 = 0 + 0.000 000 000 022 603 136;
  • 8) 0.000 000 000 022 603 136 × 2 = 0 + 0.000 000 000 045 206 272;
  • 9) 0.000 000 000 045 206 272 × 2 = 0 + 0.000 000 000 090 412 544;
  • 10) 0.000 000 000 090 412 544 × 2 = 0 + 0.000 000 000 180 825 088;
  • 11) 0.000 000 000 180 825 088 × 2 = 0 + 0.000 000 000 361 650 176;
  • 12) 0.000 000 000 361 650 176 × 2 = 0 + 0.000 000 000 723 300 352;
  • 13) 0.000 000 000 723 300 352 × 2 = 0 + 0.000 000 001 446 600 704;
  • 14) 0.000 000 001 446 600 704 × 2 = 0 + 0.000 000 002 893 201 408;
  • 15) 0.000 000 002 893 201 408 × 2 = 0 + 0.000 000 005 786 402 816;
  • 16) 0.000 000 005 786 402 816 × 2 = 0 + 0.000 000 011 572 805 632;
  • 17) 0.000 000 011 572 805 632 × 2 = 0 + 0.000 000 023 145 611 264;
  • 18) 0.000 000 023 145 611 264 × 2 = 0 + 0.000 000 046 291 222 528;
  • 19) 0.000 000 046 291 222 528 × 2 = 0 + 0.000 000 092 582 445 056;
  • 20) 0.000 000 092 582 445 056 × 2 = 0 + 0.000 000 185 164 890 112;
  • 21) 0.000 000 185 164 890 112 × 2 = 0 + 0.000 000 370 329 780 224;
  • 22) 0.000 000 370 329 780 224 × 2 = 0 + 0.000 000 740 659 560 448;
  • 23) 0.000 000 740 659 560 448 × 2 = 0 + 0.000 001 481 319 120 896;
  • 24) 0.000 001 481 319 120 896 × 2 = 0 + 0.000 002 962 638 241 792;
  • 25) 0.000 002 962 638 241 792 × 2 = 0 + 0.000 005 925 276 483 584;
  • 26) 0.000 005 925 276 483 584 × 2 = 0 + 0.000 011 850 552 967 168;
  • 27) 0.000 011 850 552 967 168 × 2 = 0 + 0.000 023 701 105 934 336;
  • 28) 0.000 023 701 105 934 336 × 2 = 0 + 0.000 047 402 211 868 672;
  • 29) 0.000 047 402 211 868 672 × 2 = 0 + 0.000 094 804 423 737 344;
  • 30) 0.000 094 804 423 737 344 × 2 = 0 + 0.000 189 608 847 474 688;
  • 31) 0.000 189 608 847 474 688 × 2 = 0 + 0.000 379 217 694 949 376;
  • 32) 0.000 379 217 694 949 376 × 2 = 0 + 0.000 758 435 389 898 752;
  • 33) 0.000 758 435 389 898 752 × 2 = 0 + 0.001 516 870 779 797 504;
  • 34) 0.001 516 870 779 797 504 × 2 = 0 + 0.003 033 741 559 595 008;
  • 35) 0.003 033 741 559 595 008 × 2 = 0 + 0.006 067 483 119 190 016;
  • 36) 0.006 067 483 119 190 016 × 2 = 0 + 0.012 134 966 238 380 032;
  • 37) 0.012 134 966 238 380 032 × 2 = 0 + 0.024 269 932 476 760 064;
  • 38) 0.024 269 932 476 760 064 × 2 = 0 + 0.048 539 864 953 520 128;
  • 39) 0.048 539 864 953 520 128 × 2 = 0 + 0.097 079 729 907 040 256;
  • 40) 0.097 079 729 907 040 256 × 2 = 0 + 0.194 159 459 814 080 512;
  • 41) 0.194 159 459 814 080 512 × 2 = 0 + 0.388 318 919 628 161 024;
  • 42) 0.388 318 919 628 161 024 × 2 = 0 + 0.776 637 839 256 322 048;
  • 43) 0.776 637 839 256 322 048 × 2 = 1 + 0.553 275 678 512 644 096;
  • 44) 0.553 275 678 512 644 096 × 2 = 1 + 0.106 551 357 025 288 192;
  • 45) 0.106 551 357 025 288 192 × 2 = 0 + 0.213 102 714 050 576 384;
  • 46) 0.213 102 714 050 576 384 × 2 = 0 + 0.426 205 428 101 152 768;
  • 47) 0.426 205 428 101 152 768 × 2 = 0 + 0.852 410 856 202 305 536;
  • 48) 0.852 410 856 202 305 536 × 2 = 1 + 0.704 821 712 404 611 072;
  • 49) 0.704 821 712 404 611 072 × 2 = 1 + 0.409 643 424 809 222 144;
  • 50) 0.409 643 424 809 222 144 × 2 = 0 + 0.819 286 849 618 444 288;
  • 51) 0.819 286 849 618 444 288 × 2 = 1 + 0.638 573 699 236 888 576;
  • 52) 0.638 573 699 236 888 576 × 2 = 1 + 0.277 147 398 473 777 152;
  • 53) 0.277 147 398 473 777 152 × 2 = 0 + 0.554 294 796 947 554 304;
  • 54) 0.554 294 796 947 554 304 × 2 = 1 + 0.108 589 593 895 108 608;
  • 55) 0.108 589 593 895 108 608 × 2 = 0 + 0.217 179 187 790 217 216;
  • 56) 0.217 179 187 790 217 216 × 2 = 0 + 0.434 358 375 580 434 432;
  • 57) 0.434 358 375 580 434 432 × 2 = 0 + 0.868 716 751 160 868 864;
  • 58) 0.868 716 751 160 868 864 × 2 = 1 + 0.737 433 502 321 737 728;
  • 59) 0.737 433 502 321 737 728 × 2 = 1 + 0.474 867 004 643 475 456;
  • 60) 0.474 867 004 643 475 456 × 2 = 0 + 0.949 734 009 286 950 912;
  • 61) 0.949 734 009 286 950 912 × 2 = 1 + 0.899 468 018 573 901 824;
  • 62) 0.899 468 018 573 901 824 × 2 = 1 + 0.798 936 037 147 803 648;
  • 63) 0.798 936 037 147 803 648 × 2 = 1 + 0.597 872 074 295 607 296;
  • 64) 0.597 872 074 295 607 296 × 2 = 1 + 0.195 744 148 591 214 592;
  • 65) 0.195 744 148 591 214 592 × 2 = 0 + 0.391 488 297 182 429 184;
  • 66) 0.391 488 297 182 429 184 × 2 = 0 + 0.782 976 594 364 858 368;
  • 67) 0.782 976 594 364 858 368 × 2 = 1 + 0.565 953 188 729 716 736;
  • 68) 0.565 953 188 729 716 736 × 2 = 1 + 0.131 906 377 459 433 472;
  • 69) 0.131 906 377 459 433 472 × 2 = 0 + 0.263 812 754 918 866 944;
  • 70) 0.263 812 754 918 866 944 × 2 = 0 + 0.527 625 509 837 733 888;
  • 71) 0.527 625 509 837 733 888 × 2 = 1 + 0.055 251 019 675 467 776;
  • 72) 0.055 251 019 675 467 776 × 2 = 0 + 0.110 502 039 350 935 552;
  • 73) 0.110 502 039 350 935 552 × 2 = 0 + 0.221 004 078 701 871 104;
  • 74) 0.221 004 078 701 871 104 × 2 = 0 + 0.442 008 157 403 742 208;
  • 75) 0.442 008 157 403 742 208 × 2 = 0 + 0.884 016 314 807 484 416;
  • 76) 0.884 016 314 807 484 416 × 2 = 1 + 0.768 032 629 614 968 832;
  • 77) 0.768 032 629 614 968 832 × 2 = 1 + 0.536 065 259 229 937 664;
  • 78) 0.536 065 259 229 937 664 × 2 = 1 + 0.072 130 518 459 875 328;
  • 79) 0.072 130 518 459 875 328 × 2 = 0 + 0.144 261 036 919 750 656;
  • 80) 0.144 261 036 919 750 656 × 2 = 0 + 0.288 522 073 839 501 312;
  • 81) 0.288 522 073 839 501 312 × 2 = 0 + 0.577 044 147 679 002 624;
  • 82) 0.577 044 147 679 002 624 × 2 = 1 + 0.154 088 295 358 005 248;
  • 83) 0.154 088 295 358 005 248 × 2 = 0 + 0.308 176 590 716 010 496;
  • 84) 0.308 176 590 716 010 496 × 2 = 0 + 0.616 353 181 432 020 992;
  • 85) 0.616 353 181 432 020 992 × 2 = 1 + 0.232 706 362 864 041 984;
  • 86) 0.232 706 362 864 041 984 × 2 = 0 + 0.465 412 725 728 083 968;
  • 87) 0.465 412 725 728 083 968 × 2 = 0 + 0.930 825 451 456 167 936;
  • 88) 0.930 825 451 456 167 936 × 2 = 1 + 0.861 650 902 912 335 872;
  • 89) 0.861 650 902 912 335 872 × 2 = 1 + 0.723 301 805 824 671 744;
  • 90) 0.723 301 805 824 671 744 × 2 = 1 + 0.446 603 611 649 343 488;
  • 91) 0.446 603 611 649 343 488 × 2 = 0 + 0.893 207 223 298 686 976;
  • 92) 0.893 207 223 298 686 976 × 2 = 1 + 0.786 414 446 597 373 952;
  • 93) 0.786 414 446 597 373 952 × 2 = 1 + 0.572 828 893 194 747 904;
  • 94) 0.572 828 893 194 747 904 × 2 = 1 + 0.145 657 786 389 495 808;
  • 95) 0.145 657 786 389 495 808 × 2 = 0 + 0.291 315 572 778 991 616;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0100 0110 1111 0011 0010 0001 1100 0100 1001 1101 110(2)

6. Positive number before normalization:

0.000 000 000 000 176 587(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0100 0110 1111 0011 0010 0001 1100 0100 1001 1101 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 587(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0100 0110 1111 0011 0010 0001 1100 0100 1001 1101 110(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0100 0110 1111 0011 0010 0001 1100 0100 1001 1101 110(2) × 20 =

1.1000 1101 1010 0011 0111 1001 1001 0000 1110 0010 0100 1110 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 1010 0011 0111 1001 1001 0000 1110 0010 0100 1110 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 1010 0011 0111 1001 1001 0000 1110 0010 0100 1110 1110 =

1000 1101 1010 0011 0111 1001 1001 0000 1110 0010 0100 1110 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 1010 0011 0111 1001 1001 0000 1110 0010 0100 1110 1110


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

1 - 011 1101 0100 - 1000 1101 1010 0011 0111 1001 1001 0000 1110 0010 0100 1110 1110

Share

» Convert decimal -0.000 000 000 000 176 53 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: The Hidden Requirement in Every Single Job Description. NotebookLM YouTube Video of 8.15 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