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

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


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

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 699 × 2 = 0 + 0.000 000 000 000 353 398;
  • 2) 0.000 000 000 000 353 398 × 2 = 0 + 0.000 000 000 000 706 796;
  • 3) 0.000 000 000 000 706 796 × 2 = 0 + 0.000 000 000 001 413 592;
  • 4) 0.000 000 000 001 413 592 × 2 = 0 + 0.000 000 000 002 827 184;
  • 5) 0.000 000 000 002 827 184 × 2 = 0 + 0.000 000 000 005 654 368;
  • 6) 0.000 000 000 005 654 368 × 2 = 0 + 0.000 000 000 011 308 736;
  • 7) 0.000 000 000 011 308 736 × 2 = 0 + 0.000 000 000 022 617 472;
  • 8) 0.000 000 000 022 617 472 × 2 = 0 + 0.000 000 000 045 234 944;
  • 9) 0.000 000 000 045 234 944 × 2 = 0 + 0.000 000 000 090 469 888;
  • 10) 0.000 000 000 090 469 888 × 2 = 0 + 0.000 000 000 180 939 776;
  • 11) 0.000 000 000 180 939 776 × 2 = 0 + 0.000 000 000 361 879 552;
  • 12) 0.000 000 000 361 879 552 × 2 = 0 + 0.000 000 000 723 759 104;
  • 13) 0.000 000 000 723 759 104 × 2 = 0 + 0.000 000 001 447 518 208;
  • 14) 0.000 000 001 447 518 208 × 2 = 0 + 0.000 000 002 895 036 416;
  • 15) 0.000 000 002 895 036 416 × 2 = 0 + 0.000 000 005 790 072 832;
  • 16) 0.000 000 005 790 072 832 × 2 = 0 + 0.000 000 011 580 145 664;
  • 17) 0.000 000 011 580 145 664 × 2 = 0 + 0.000 000 023 160 291 328;
  • 18) 0.000 000 023 160 291 328 × 2 = 0 + 0.000 000 046 320 582 656;
  • 19) 0.000 000 046 320 582 656 × 2 = 0 + 0.000 000 092 641 165 312;
  • 20) 0.000 000 092 641 165 312 × 2 = 0 + 0.000 000 185 282 330 624;
  • 21) 0.000 000 185 282 330 624 × 2 = 0 + 0.000 000 370 564 661 248;
  • 22) 0.000 000 370 564 661 248 × 2 = 0 + 0.000 000 741 129 322 496;
  • 23) 0.000 000 741 129 322 496 × 2 = 0 + 0.000 001 482 258 644 992;
  • 24) 0.000 001 482 258 644 992 × 2 = 0 + 0.000 002 964 517 289 984;
  • 25) 0.000 002 964 517 289 984 × 2 = 0 + 0.000 005 929 034 579 968;
  • 26) 0.000 005 929 034 579 968 × 2 = 0 + 0.000 011 858 069 159 936;
  • 27) 0.000 011 858 069 159 936 × 2 = 0 + 0.000 023 716 138 319 872;
  • 28) 0.000 023 716 138 319 872 × 2 = 0 + 0.000 047 432 276 639 744;
  • 29) 0.000 047 432 276 639 744 × 2 = 0 + 0.000 094 864 553 279 488;
  • 30) 0.000 094 864 553 279 488 × 2 = 0 + 0.000 189 729 106 558 976;
  • 31) 0.000 189 729 106 558 976 × 2 = 0 + 0.000 379 458 213 117 952;
  • 32) 0.000 379 458 213 117 952 × 2 = 0 + 0.000 758 916 426 235 904;
  • 33) 0.000 758 916 426 235 904 × 2 = 0 + 0.001 517 832 852 471 808;
  • 34) 0.001 517 832 852 471 808 × 2 = 0 + 0.003 035 665 704 943 616;
  • 35) 0.003 035 665 704 943 616 × 2 = 0 + 0.006 071 331 409 887 232;
  • 36) 0.006 071 331 409 887 232 × 2 = 0 + 0.012 142 662 819 774 464;
  • 37) 0.012 142 662 819 774 464 × 2 = 0 + 0.024 285 325 639 548 928;
  • 38) 0.024 285 325 639 548 928 × 2 = 0 + 0.048 570 651 279 097 856;
  • 39) 0.048 570 651 279 097 856 × 2 = 0 + 0.097 141 302 558 195 712;
  • 40) 0.097 141 302 558 195 712 × 2 = 0 + 0.194 282 605 116 391 424;
  • 41) 0.194 282 605 116 391 424 × 2 = 0 + 0.388 565 210 232 782 848;
  • 42) 0.388 565 210 232 782 848 × 2 = 0 + 0.777 130 420 465 565 696;
  • 43) 0.777 130 420 465 565 696 × 2 = 1 + 0.554 260 840 931 131 392;
  • 44) 0.554 260 840 931 131 392 × 2 = 1 + 0.108 521 681 862 262 784;
  • 45) 0.108 521 681 862 262 784 × 2 = 0 + 0.217 043 363 724 525 568;
  • 46) 0.217 043 363 724 525 568 × 2 = 0 + 0.434 086 727 449 051 136;
  • 47) 0.434 086 727 449 051 136 × 2 = 0 + 0.868 173 454 898 102 272;
  • 48) 0.868 173 454 898 102 272 × 2 = 1 + 0.736 346 909 796 204 544;
  • 49) 0.736 346 909 796 204 544 × 2 = 1 + 0.472 693 819 592 409 088;
  • 50) 0.472 693 819 592 409 088 × 2 = 0 + 0.945 387 639 184 818 176;
  • 51) 0.945 387 639 184 818 176 × 2 = 1 + 0.890 775 278 369 636 352;
  • 52) 0.890 775 278 369 636 352 × 2 = 1 + 0.781 550 556 739 272 704;
  • 53) 0.781 550 556 739 272 704 × 2 = 1 + 0.563 101 113 478 545 408;
  • 54) 0.563 101 113 478 545 408 × 2 = 1 + 0.126 202 226 957 090 816;
  • 55) 0.126 202 226 957 090 816 × 2 = 0 + 0.252 404 453 914 181 632;
  • 56) 0.252 404 453 914 181 632 × 2 = 0 + 0.504 808 907 828 363 264;
  • 57) 0.504 808 907 828 363 264 × 2 = 1 + 0.009 617 815 656 726 528;
  • 58) 0.009 617 815 656 726 528 × 2 = 0 + 0.019 235 631 313 453 056;
  • 59) 0.019 235 631 313 453 056 × 2 = 0 + 0.038 471 262 626 906 112;
  • 60) 0.038 471 262 626 906 112 × 2 = 0 + 0.076 942 525 253 812 224;
  • 61) 0.076 942 525 253 812 224 × 2 = 0 + 0.153 885 050 507 624 448;
  • 62) 0.153 885 050 507 624 448 × 2 = 0 + 0.307 770 101 015 248 896;
  • 63) 0.307 770 101 015 248 896 × 2 = 0 + 0.615 540 202 030 497 792;
  • 64) 0.615 540 202 030 497 792 × 2 = 1 + 0.231 080 404 060 995 584;
  • 65) 0.231 080 404 060 995 584 × 2 = 0 + 0.462 160 808 121 991 168;
  • 66) 0.462 160 808 121 991 168 × 2 = 0 + 0.924 321 616 243 982 336;
  • 67) 0.924 321 616 243 982 336 × 2 = 1 + 0.848 643 232 487 964 672;
  • 68) 0.848 643 232 487 964 672 × 2 = 1 + 0.697 286 464 975 929 344;
  • 69) 0.697 286 464 975 929 344 × 2 = 1 + 0.394 572 929 951 858 688;
  • 70) 0.394 572 929 951 858 688 × 2 = 0 + 0.789 145 859 903 717 376;
  • 71) 0.789 145 859 903 717 376 × 2 = 1 + 0.578 291 719 807 434 752;
  • 72) 0.578 291 719 807 434 752 × 2 = 1 + 0.156 583 439 614 869 504;
  • 73) 0.156 583 439 614 869 504 × 2 = 0 + 0.313 166 879 229 739 008;
  • 74) 0.313 166 879 229 739 008 × 2 = 0 + 0.626 333 758 459 478 016;
  • 75) 0.626 333 758 459 478 016 × 2 = 1 + 0.252 667 516 918 956 032;
  • 76) 0.252 667 516 918 956 032 × 2 = 0 + 0.505 335 033 837 912 064;
  • 77) 0.505 335 033 837 912 064 × 2 = 1 + 0.010 670 067 675 824 128;
  • 78) 0.010 670 067 675 824 128 × 2 = 0 + 0.021 340 135 351 648 256;
  • 79) 0.021 340 135 351 648 256 × 2 = 0 + 0.042 680 270 703 296 512;
  • 80) 0.042 680 270 703 296 512 × 2 = 0 + 0.085 360 541 406 593 024;
  • 81) 0.085 360 541 406 593 024 × 2 = 0 + 0.170 721 082 813 186 048;
  • 82) 0.170 721 082 813 186 048 × 2 = 0 + 0.341 442 165 626 372 096;
  • 83) 0.341 442 165 626 372 096 × 2 = 0 + 0.682 884 331 252 744 192;
  • 84) 0.682 884 331 252 744 192 × 2 = 1 + 0.365 768 662 505 488 384;
  • 85) 0.365 768 662 505 488 384 × 2 = 0 + 0.731 537 325 010 976 768;
  • 86) 0.731 537 325 010 976 768 × 2 = 1 + 0.463 074 650 021 953 536;
  • 87) 0.463 074 650 021 953 536 × 2 = 0 + 0.926 149 300 043 907 072;
  • 88) 0.926 149 300 043 907 072 × 2 = 1 + 0.852 298 600 087 814 144;
  • 89) 0.852 298 600 087 814 144 × 2 = 1 + 0.704 597 200 175 628 288;
  • 90) 0.704 597 200 175 628 288 × 2 = 1 + 0.409 194 400 351 256 576;
  • 91) 0.409 194 400 351 256 576 × 2 = 0 + 0.818 388 800 702 513 152;
  • 92) 0.818 388 800 702 513 152 × 2 = 1 + 0.636 777 601 405 026 304;
  • 93) 0.636 777 601 405 026 304 × 2 = 1 + 0.273 555 202 810 052 608;
  • 94) 0.273 555 202 810 052 608 × 2 = 0 + 0.547 110 405 620 105 216;
  • 95) 0.547 110 405 620 105 216 × 2 = 1 + 0.094 220 811 240 210 432;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1100 1000 0001 0011 1011 0010 1000 0001 0101 1101 101(2)

6. Positive number before normalization:

0.000 000 000 000 176 699(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1100 1000 0001 0011 1011 0010 1000 0001 0101 1101 101(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 699(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1100 1000 0001 0011 1011 0010 1000 0001 0101 1101 101(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1100 1000 0001 0011 1011 0010 1000 0001 0101 1101 101(2) × 20 =

1.1000 1101 1110 0100 0000 1001 1101 1001 0100 0000 1010 1110 1101(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 1110 0100 0000 1001 1101 1001 0100 0000 1010 1110 1101


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 1110 0100 0000 1001 1101 1001 0100 0000 1010 1110 1101 =

1000 1101 1110 0100 0000 1001 1101 1001 0100 0000 1010 1110 1101


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 1110 0100 0000 1001 1101 1001 0100 0000 1010 1110 1101


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

1 - 011 1101 0100 - 1000 1101 1110 0100 0000 1001 1101 1001 0100 0000 1010 1110 1101

Share

» Convert decimal -0.000 000 000 000 176 678 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 Attention Economy - The Battlefield For Your Focus. NotebookLM YouTube Video of 7.50 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