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

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


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

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 601 × 2 = 0 + 0.000 000 000 000 353 202;
  • 2) 0.000 000 000 000 353 202 × 2 = 0 + 0.000 000 000 000 706 404;
  • 3) 0.000 000 000 000 706 404 × 2 = 0 + 0.000 000 000 001 412 808;
  • 4) 0.000 000 000 001 412 808 × 2 = 0 + 0.000 000 000 002 825 616;
  • 5) 0.000 000 000 002 825 616 × 2 = 0 + 0.000 000 000 005 651 232;
  • 6) 0.000 000 000 005 651 232 × 2 = 0 + 0.000 000 000 011 302 464;
  • 7) 0.000 000 000 011 302 464 × 2 = 0 + 0.000 000 000 022 604 928;
  • 8) 0.000 000 000 022 604 928 × 2 = 0 + 0.000 000 000 045 209 856;
  • 9) 0.000 000 000 045 209 856 × 2 = 0 + 0.000 000 000 090 419 712;
  • 10) 0.000 000 000 090 419 712 × 2 = 0 + 0.000 000 000 180 839 424;
  • 11) 0.000 000 000 180 839 424 × 2 = 0 + 0.000 000 000 361 678 848;
  • 12) 0.000 000 000 361 678 848 × 2 = 0 + 0.000 000 000 723 357 696;
  • 13) 0.000 000 000 723 357 696 × 2 = 0 + 0.000 000 001 446 715 392;
  • 14) 0.000 000 001 446 715 392 × 2 = 0 + 0.000 000 002 893 430 784;
  • 15) 0.000 000 002 893 430 784 × 2 = 0 + 0.000 000 005 786 861 568;
  • 16) 0.000 000 005 786 861 568 × 2 = 0 + 0.000 000 011 573 723 136;
  • 17) 0.000 000 011 573 723 136 × 2 = 0 + 0.000 000 023 147 446 272;
  • 18) 0.000 000 023 147 446 272 × 2 = 0 + 0.000 000 046 294 892 544;
  • 19) 0.000 000 046 294 892 544 × 2 = 0 + 0.000 000 092 589 785 088;
  • 20) 0.000 000 092 589 785 088 × 2 = 0 + 0.000 000 185 179 570 176;
  • 21) 0.000 000 185 179 570 176 × 2 = 0 + 0.000 000 370 359 140 352;
  • 22) 0.000 000 370 359 140 352 × 2 = 0 + 0.000 000 740 718 280 704;
  • 23) 0.000 000 740 718 280 704 × 2 = 0 + 0.000 001 481 436 561 408;
  • 24) 0.000 001 481 436 561 408 × 2 = 0 + 0.000 002 962 873 122 816;
  • 25) 0.000 002 962 873 122 816 × 2 = 0 + 0.000 005 925 746 245 632;
  • 26) 0.000 005 925 746 245 632 × 2 = 0 + 0.000 011 851 492 491 264;
  • 27) 0.000 011 851 492 491 264 × 2 = 0 + 0.000 023 702 984 982 528;
  • 28) 0.000 023 702 984 982 528 × 2 = 0 + 0.000 047 405 969 965 056;
  • 29) 0.000 047 405 969 965 056 × 2 = 0 + 0.000 094 811 939 930 112;
  • 30) 0.000 094 811 939 930 112 × 2 = 0 + 0.000 189 623 879 860 224;
  • 31) 0.000 189 623 879 860 224 × 2 = 0 + 0.000 379 247 759 720 448;
  • 32) 0.000 379 247 759 720 448 × 2 = 0 + 0.000 758 495 519 440 896;
  • 33) 0.000 758 495 519 440 896 × 2 = 0 + 0.001 516 991 038 881 792;
  • 34) 0.001 516 991 038 881 792 × 2 = 0 + 0.003 033 982 077 763 584;
  • 35) 0.003 033 982 077 763 584 × 2 = 0 + 0.006 067 964 155 527 168;
  • 36) 0.006 067 964 155 527 168 × 2 = 0 + 0.012 135 928 311 054 336;
  • 37) 0.012 135 928 311 054 336 × 2 = 0 + 0.024 271 856 622 108 672;
  • 38) 0.024 271 856 622 108 672 × 2 = 0 + 0.048 543 713 244 217 344;
  • 39) 0.048 543 713 244 217 344 × 2 = 0 + 0.097 087 426 488 434 688;
  • 40) 0.097 087 426 488 434 688 × 2 = 0 + 0.194 174 852 976 869 376;
  • 41) 0.194 174 852 976 869 376 × 2 = 0 + 0.388 349 705 953 738 752;
  • 42) 0.388 349 705 953 738 752 × 2 = 0 + 0.776 699 411 907 477 504;
  • 43) 0.776 699 411 907 477 504 × 2 = 1 + 0.553 398 823 814 955 008;
  • 44) 0.553 398 823 814 955 008 × 2 = 1 + 0.106 797 647 629 910 016;
  • 45) 0.106 797 647 629 910 016 × 2 = 0 + 0.213 595 295 259 820 032;
  • 46) 0.213 595 295 259 820 032 × 2 = 0 + 0.427 190 590 519 640 064;
  • 47) 0.427 190 590 519 640 064 × 2 = 0 + 0.854 381 181 039 280 128;
  • 48) 0.854 381 181 039 280 128 × 2 = 1 + 0.708 762 362 078 560 256;
  • 49) 0.708 762 362 078 560 256 × 2 = 1 + 0.417 524 724 157 120 512;
  • 50) 0.417 524 724 157 120 512 × 2 = 0 + 0.835 049 448 314 241 024;
  • 51) 0.835 049 448 314 241 024 × 2 = 1 + 0.670 098 896 628 482 048;
  • 52) 0.670 098 896 628 482 048 × 2 = 1 + 0.340 197 793 256 964 096;
  • 53) 0.340 197 793 256 964 096 × 2 = 0 + 0.680 395 586 513 928 192;
  • 54) 0.680 395 586 513 928 192 × 2 = 1 + 0.360 791 173 027 856 384;
  • 55) 0.360 791 173 027 856 384 × 2 = 0 + 0.721 582 346 055 712 768;
  • 56) 0.721 582 346 055 712 768 × 2 = 1 + 0.443 164 692 111 425 536;
  • 57) 0.443 164 692 111 425 536 × 2 = 0 + 0.886 329 384 222 851 072;
  • 58) 0.886 329 384 222 851 072 × 2 = 1 + 0.772 658 768 445 702 144;
  • 59) 0.772 658 768 445 702 144 × 2 = 1 + 0.545 317 536 891 404 288;
  • 60) 0.545 317 536 891 404 288 × 2 = 1 + 0.090 635 073 782 808 576;
  • 61) 0.090 635 073 782 808 576 × 2 = 0 + 0.181 270 147 565 617 152;
  • 62) 0.181 270 147 565 617 152 × 2 = 0 + 0.362 540 295 131 234 304;
  • 63) 0.362 540 295 131 234 304 × 2 = 0 + 0.725 080 590 262 468 608;
  • 64) 0.725 080 590 262 468 608 × 2 = 1 + 0.450 161 180 524 937 216;
  • 65) 0.450 161 180 524 937 216 × 2 = 0 + 0.900 322 361 049 874 432;
  • 66) 0.900 322 361 049 874 432 × 2 = 1 + 0.800 644 722 099 748 864;
  • 67) 0.800 644 722 099 748 864 × 2 = 1 + 0.601 289 444 199 497 728;
  • 68) 0.601 289 444 199 497 728 × 2 = 1 + 0.202 578 888 398 995 456;
  • 69) 0.202 578 888 398 995 456 × 2 = 0 + 0.405 157 776 797 990 912;
  • 70) 0.405 157 776 797 990 912 × 2 = 0 + 0.810 315 553 595 981 824;
  • 71) 0.810 315 553 595 981 824 × 2 = 1 + 0.620 631 107 191 963 648;
  • 72) 0.620 631 107 191 963 648 × 2 = 1 + 0.241 262 214 383 927 296;
  • 73) 0.241 262 214 383 927 296 × 2 = 0 + 0.482 524 428 767 854 592;
  • 74) 0.482 524 428 767 854 592 × 2 = 0 + 0.965 048 857 535 709 184;
  • 75) 0.965 048 857 535 709 184 × 2 = 1 + 0.930 097 715 071 418 368;
  • 76) 0.930 097 715 071 418 368 × 2 = 1 + 0.860 195 430 142 836 736;
  • 77) 0.860 195 430 142 836 736 × 2 = 1 + 0.720 390 860 285 673 472;
  • 78) 0.720 390 860 285 673 472 × 2 = 1 + 0.440 781 720 571 346 944;
  • 79) 0.440 781 720 571 346 944 × 2 = 0 + 0.881 563 441 142 693 888;
  • 80) 0.881 563 441 142 693 888 × 2 = 1 + 0.763 126 882 285 387 776;
  • 81) 0.763 126 882 285 387 776 × 2 = 1 + 0.526 253 764 570 775 552;
  • 82) 0.526 253 764 570 775 552 × 2 = 1 + 0.052 507 529 141 551 104;
  • 83) 0.052 507 529 141 551 104 × 2 = 0 + 0.105 015 058 283 102 208;
  • 84) 0.105 015 058 283 102 208 × 2 = 0 + 0.210 030 116 566 204 416;
  • 85) 0.210 030 116 566 204 416 × 2 = 0 + 0.420 060 233 132 408 832;
  • 86) 0.420 060 233 132 408 832 × 2 = 0 + 0.840 120 466 264 817 664;
  • 87) 0.840 120 466 264 817 664 × 2 = 1 + 0.680 240 932 529 635 328;
  • 88) 0.680 240 932 529 635 328 × 2 = 1 + 0.360 481 865 059 270 656;
  • 89) 0.360 481 865 059 270 656 × 2 = 0 + 0.720 963 730 118 541 312;
  • 90) 0.720 963 730 118 541 312 × 2 = 1 + 0.441 927 460 237 082 624;
  • 91) 0.441 927 460 237 082 624 × 2 = 0 + 0.883 854 920 474 165 248;
  • 92) 0.883 854 920 474 165 248 × 2 = 1 + 0.767 709 840 948 330 496;
  • 93) 0.767 709 840 948 330 496 × 2 = 1 + 0.535 419 681 896 660 992;
  • 94) 0.535 419 681 896 660 992 × 2 = 1 + 0.070 839 363 793 321 984;
  • 95) 0.070 839 363 793 321 984 × 2 = 0 + 0.141 678 727 586 643 968;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0101 0111 0001 0111 0011 0011 1101 1100 0011 0101 110(2)

6. Positive number before normalization:

0.000 000 000 000 176 601(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0101 0111 0001 0111 0011 0011 1101 1100 0011 0101 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 601(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0101 0111 0001 0111 0011 0011 1101 1100 0011 0101 110(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0101 0111 0001 0111 0011 0011 1101 1100 0011 0101 110(2) × 20 =

1.1000 1101 1010 1011 1000 1011 1001 1001 1110 1110 0001 1010 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 1011 1000 1011 1001 1001 1110 1110 0001 1010 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 1011 1000 1011 1001 1001 1110 1110 0001 1010 1110 =

1000 1101 1010 1011 1000 1011 1001 1001 1110 1110 0001 1010 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 1011 1000 1011 1001 1001 1110 1110 0001 1010 1110


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

1 - 011 1101 0100 - 1000 1101 1010 1011 1000 1011 1001 1001 1110 1110 0001 1010 1110

Share

» Convert decimal -0.000 000 000 000 176 569 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: My manager only says "we" when referring to "my work". NotebookLM YouTube Video of 11.13 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