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

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


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

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 537 × 2 = 0 + 0.000 000 000 000 353 074;
  • 2) 0.000 000 000 000 353 074 × 2 = 0 + 0.000 000 000 000 706 148;
  • 3) 0.000 000 000 000 706 148 × 2 = 0 + 0.000 000 000 001 412 296;
  • 4) 0.000 000 000 001 412 296 × 2 = 0 + 0.000 000 000 002 824 592;
  • 5) 0.000 000 000 002 824 592 × 2 = 0 + 0.000 000 000 005 649 184;
  • 6) 0.000 000 000 005 649 184 × 2 = 0 + 0.000 000 000 011 298 368;
  • 7) 0.000 000 000 011 298 368 × 2 = 0 + 0.000 000 000 022 596 736;
  • 8) 0.000 000 000 022 596 736 × 2 = 0 + 0.000 000 000 045 193 472;
  • 9) 0.000 000 000 045 193 472 × 2 = 0 + 0.000 000 000 090 386 944;
  • 10) 0.000 000 000 090 386 944 × 2 = 0 + 0.000 000 000 180 773 888;
  • 11) 0.000 000 000 180 773 888 × 2 = 0 + 0.000 000 000 361 547 776;
  • 12) 0.000 000 000 361 547 776 × 2 = 0 + 0.000 000 000 723 095 552;
  • 13) 0.000 000 000 723 095 552 × 2 = 0 + 0.000 000 001 446 191 104;
  • 14) 0.000 000 001 446 191 104 × 2 = 0 + 0.000 000 002 892 382 208;
  • 15) 0.000 000 002 892 382 208 × 2 = 0 + 0.000 000 005 784 764 416;
  • 16) 0.000 000 005 784 764 416 × 2 = 0 + 0.000 000 011 569 528 832;
  • 17) 0.000 000 011 569 528 832 × 2 = 0 + 0.000 000 023 139 057 664;
  • 18) 0.000 000 023 139 057 664 × 2 = 0 + 0.000 000 046 278 115 328;
  • 19) 0.000 000 046 278 115 328 × 2 = 0 + 0.000 000 092 556 230 656;
  • 20) 0.000 000 092 556 230 656 × 2 = 0 + 0.000 000 185 112 461 312;
  • 21) 0.000 000 185 112 461 312 × 2 = 0 + 0.000 000 370 224 922 624;
  • 22) 0.000 000 370 224 922 624 × 2 = 0 + 0.000 000 740 449 845 248;
  • 23) 0.000 000 740 449 845 248 × 2 = 0 + 0.000 001 480 899 690 496;
  • 24) 0.000 001 480 899 690 496 × 2 = 0 + 0.000 002 961 799 380 992;
  • 25) 0.000 002 961 799 380 992 × 2 = 0 + 0.000 005 923 598 761 984;
  • 26) 0.000 005 923 598 761 984 × 2 = 0 + 0.000 011 847 197 523 968;
  • 27) 0.000 011 847 197 523 968 × 2 = 0 + 0.000 023 694 395 047 936;
  • 28) 0.000 023 694 395 047 936 × 2 = 0 + 0.000 047 388 790 095 872;
  • 29) 0.000 047 388 790 095 872 × 2 = 0 + 0.000 094 777 580 191 744;
  • 30) 0.000 094 777 580 191 744 × 2 = 0 + 0.000 189 555 160 383 488;
  • 31) 0.000 189 555 160 383 488 × 2 = 0 + 0.000 379 110 320 766 976;
  • 32) 0.000 379 110 320 766 976 × 2 = 0 + 0.000 758 220 641 533 952;
  • 33) 0.000 758 220 641 533 952 × 2 = 0 + 0.001 516 441 283 067 904;
  • 34) 0.001 516 441 283 067 904 × 2 = 0 + 0.003 032 882 566 135 808;
  • 35) 0.003 032 882 566 135 808 × 2 = 0 + 0.006 065 765 132 271 616;
  • 36) 0.006 065 765 132 271 616 × 2 = 0 + 0.012 131 530 264 543 232;
  • 37) 0.012 131 530 264 543 232 × 2 = 0 + 0.024 263 060 529 086 464;
  • 38) 0.024 263 060 529 086 464 × 2 = 0 + 0.048 526 121 058 172 928;
  • 39) 0.048 526 121 058 172 928 × 2 = 0 + 0.097 052 242 116 345 856;
  • 40) 0.097 052 242 116 345 856 × 2 = 0 + 0.194 104 484 232 691 712;
  • 41) 0.194 104 484 232 691 712 × 2 = 0 + 0.388 208 968 465 383 424;
  • 42) 0.388 208 968 465 383 424 × 2 = 0 + 0.776 417 936 930 766 848;
  • 43) 0.776 417 936 930 766 848 × 2 = 1 + 0.552 835 873 861 533 696;
  • 44) 0.552 835 873 861 533 696 × 2 = 1 + 0.105 671 747 723 067 392;
  • 45) 0.105 671 747 723 067 392 × 2 = 0 + 0.211 343 495 446 134 784;
  • 46) 0.211 343 495 446 134 784 × 2 = 0 + 0.422 686 990 892 269 568;
  • 47) 0.422 686 990 892 269 568 × 2 = 0 + 0.845 373 981 784 539 136;
  • 48) 0.845 373 981 784 539 136 × 2 = 1 + 0.690 747 963 569 078 272;
  • 49) 0.690 747 963 569 078 272 × 2 = 1 + 0.381 495 927 138 156 544;
  • 50) 0.381 495 927 138 156 544 × 2 = 0 + 0.762 991 854 276 313 088;
  • 51) 0.762 991 854 276 313 088 × 2 = 1 + 0.525 983 708 552 626 176;
  • 52) 0.525 983 708 552 626 176 × 2 = 1 + 0.051 967 417 105 252 352;
  • 53) 0.051 967 417 105 252 352 × 2 = 0 + 0.103 934 834 210 504 704;
  • 54) 0.103 934 834 210 504 704 × 2 = 0 + 0.207 869 668 421 009 408;
  • 55) 0.207 869 668 421 009 408 × 2 = 0 + 0.415 739 336 842 018 816;
  • 56) 0.415 739 336 842 018 816 × 2 = 0 + 0.831 478 673 684 037 632;
  • 57) 0.831 478 673 684 037 632 × 2 = 1 + 0.662 957 347 368 075 264;
  • 58) 0.662 957 347 368 075 264 × 2 = 1 + 0.325 914 694 736 150 528;
  • 59) 0.325 914 694 736 150 528 × 2 = 0 + 0.651 829 389 472 301 056;
  • 60) 0.651 829 389 472 301 056 × 2 = 1 + 0.303 658 778 944 602 112;
  • 61) 0.303 658 778 944 602 112 × 2 = 0 + 0.607 317 557 889 204 224;
  • 62) 0.607 317 557 889 204 224 × 2 = 1 + 0.214 635 115 778 408 448;
  • 63) 0.214 635 115 778 408 448 × 2 = 0 + 0.429 270 231 556 816 896;
  • 64) 0.429 270 231 556 816 896 × 2 = 0 + 0.858 540 463 113 633 792;
  • 65) 0.858 540 463 113 633 792 × 2 = 1 + 0.717 080 926 227 267 584;
  • 66) 0.717 080 926 227 267 584 × 2 = 1 + 0.434 161 852 454 535 168;
  • 67) 0.434 161 852 454 535 168 × 2 = 0 + 0.868 323 704 909 070 336;
  • 68) 0.868 323 704 909 070 336 × 2 = 1 + 0.736 647 409 818 140 672;
  • 69) 0.736 647 409 818 140 672 × 2 = 1 + 0.473 294 819 636 281 344;
  • 70) 0.473 294 819 636 281 344 × 2 = 0 + 0.946 589 639 272 562 688;
  • 71) 0.946 589 639 272 562 688 × 2 = 1 + 0.893 179 278 545 125 376;
  • 72) 0.893 179 278 545 125 376 × 2 = 1 + 0.786 358 557 090 250 752;
  • 73) 0.786 358 557 090 250 752 × 2 = 1 + 0.572 717 114 180 501 504;
  • 74) 0.572 717 114 180 501 504 × 2 = 1 + 0.145 434 228 361 003 008;
  • 75) 0.145 434 228 361 003 008 × 2 = 0 + 0.290 868 456 722 006 016;
  • 76) 0.290 868 456 722 006 016 × 2 = 0 + 0.581 736 913 444 012 032;
  • 77) 0.581 736 913 444 012 032 × 2 = 1 + 0.163 473 826 888 024 064;
  • 78) 0.163 473 826 888 024 064 × 2 = 0 + 0.326 947 653 776 048 128;
  • 79) 0.326 947 653 776 048 128 × 2 = 0 + 0.653 895 307 552 096 256;
  • 80) 0.653 895 307 552 096 256 × 2 = 1 + 0.307 790 615 104 192 512;
  • 81) 0.307 790 615 104 192 512 × 2 = 0 + 0.615 581 230 208 385 024;
  • 82) 0.615 581 230 208 385 024 × 2 = 1 + 0.231 162 460 416 770 048;
  • 83) 0.231 162 460 416 770 048 × 2 = 0 + 0.462 324 920 833 540 096;
  • 84) 0.462 324 920 833 540 096 × 2 = 0 + 0.924 649 841 667 080 192;
  • 85) 0.924 649 841 667 080 192 × 2 = 1 + 0.849 299 683 334 160 384;
  • 86) 0.849 299 683 334 160 384 × 2 = 1 + 0.698 599 366 668 320 768;
  • 87) 0.698 599 366 668 320 768 × 2 = 1 + 0.397 198 733 336 641 536;
  • 88) 0.397 198 733 336 641 536 × 2 = 0 + 0.794 397 466 673 283 072;
  • 89) 0.794 397 466 673 283 072 × 2 = 1 + 0.588 794 933 346 566 144;
  • 90) 0.588 794 933 346 566 144 × 2 = 1 + 0.177 589 866 693 132 288;
  • 91) 0.177 589 866 693 132 288 × 2 = 0 + 0.355 179 733 386 264 576;
  • 92) 0.355 179 733 386 264 576 × 2 = 0 + 0.710 359 466 772 529 152;
  • 93) 0.710 359 466 772 529 152 × 2 = 1 + 0.420 718 933 545 058 304;
  • 94) 0.420 718 933 545 058 304 × 2 = 0 + 0.841 437 867 090 116 608;
  • 95) 0.841 437 867 090 116 608 × 2 = 1 + 0.682 875 734 180 233 216;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0000 1101 0100 1101 1011 1100 1001 0100 1110 1100 101(2)

6. Positive number before normalization:

0.000 000 000 000 176 537(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0000 1101 0100 1101 1011 1100 1001 0100 1110 1100 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 537(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0000 1101 0100 1101 1011 1100 1001 0100 1110 1100 101(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0000 1101 0100 1101 1011 1100 1001 0100 1110 1100 101(2) × 20 =

1.1000 1101 1000 0110 1010 0110 1101 1110 0100 1010 0111 0110 0101(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 1000 0110 1010 0110 1101 1110 0100 1010 0111 0110 0101


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 1000 0110 1010 0110 1101 1110 0100 1010 0111 0110 0101 =

1000 1101 1000 0110 1010 0110 1101 1110 0100 1010 0111 0110 0101


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 1000 0110 1010 0110 1101 1110 0100 1010 0111 0110 0101


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

1 - 011 1101 0100 - 1000 1101 1000 0110 1010 0110 1101 1110 0100 1010 0111 0110 0101

Share

» Convert decimal -0.000 000 000 000 176 558 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: Are you using communication by design, or by default? NotebookLM YouTube Video of 6.33 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