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

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


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

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 678 × 2 = 0 + 0.000 000 000 000 353 356;
  • 2) 0.000 000 000 000 353 356 × 2 = 0 + 0.000 000 000 000 706 712;
  • 3) 0.000 000 000 000 706 712 × 2 = 0 + 0.000 000 000 001 413 424;
  • 4) 0.000 000 000 001 413 424 × 2 = 0 + 0.000 000 000 002 826 848;
  • 5) 0.000 000 000 002 826 848 × 2 = 0 + 0.000 000 000 005 653 696;
  • 6) 0.000 000 000 005 653 696 × 2 = 0 + 0.000 000 000 011 307 392;
  • 7) 0.000 000 000 011 307 392 × 2 = 0 + 0.000 000 000 022 614 784;
  • 8) 0.000 000 000 022 614 784 × 2 = 0 + 0.000 000 000 045 229 568;
  • 9) 0.000 000 000 045 229 568 × 2 = 0 + 0.000 000 000 090 459 136;
  • 10) 0.000 000 000 090 459 136 × 2 = 0 + 0.000 000 000 180 918 272;
  • 11) 0.000 000 000 180 918 272 × 2 = 0 + 0.000 000 000 361 836 544;
  • 12) 0.000 000 000 361 836 544 × 2 = 0 + 0.000 000 000 723 673 088;
  • 13) 0.000 000 000 723 673 088 × 2 = 0 + 0.000 000 001 447 346 176;
  • 14) 0.000 000 001 447 346 176 × 2 = 0 + 0.000 000 002 894 692 352;
  • 15) 0.000 000 002 894 692 352 × 2 = 0 + 0.000 000 005 789 384 704;
  • 16) 0.000 000 005 789 384 704 × 2 = 0 + 0.000 000 011 578 769 408;
  • 17) 0.000 000 011 578 769 408 × 2 = 0 + 0.000 000 023 157 538 816;
  • 18) 0.000 000 023 157 538 816 × 2 = 0 + 0.000 000 046 315 077 632;
  • 19) 0.000 000 046 315 077 632 × 2 = 0 + 0.000 000 092 630 155 264;
  • 20) 0.000 000 092 630 155 264 × 2 = 0 + 0.000 000 185 260 310 528;
  • 21) 0.000 000 185 260 310 528 × 2 = 0 + 0.000 000 370 520 621 056;
  • 22) 0.000 000 370 520 621 056 × 2 = 0 + 0.000 000 741 041 242 112;
  • 23) 0.000 000 741 041 242 112 × 2 = 0 + 0.000 001 482 082 484 224;
  • 24) 0.000 001 482 082 484 224 × 2 = 0 + 0.000 002 964 164 968 448;
  • 25) 0.000 002 964 164 968 448 × 2 = 0 + 0.000 005 928 329 936 896;
  • 26) 0.000 005 928 329 936 896 × 2 = 0 + 0.000 011 856 659 873 792;
  • 27) 0.000 011 856 659 873 792 × 2 = 0 + 0.000 023 713 319 747 584;
  • 28) 0.000 023 713 319 747 584 × 2 = 0 + 0.000 047 426 639 495 168;
  • 29) 0.000 047 426 639 495 168 × 2 = 0 + 0.000 094 853 278 990 336;
  • 30) 0.000 094 853 278 990 336 × 2 = 0 + 0.000 189 706 557 980 672;
  • 31) 0.000 189 706 557 980 672 × 2 = 0 + 0.000 379 413 115 961 344;
  • 32) 0.000 379 413 115 961 344 × 2 = 0 + 0.000 758 826 231 922 688;
  • 33) 0.000 758 826 231 922 688 × 2 = 0 + 0.001 517 652 463 845 376;
  • 34) 0.001 517 652 463 845 376 × 2 = 0 + 0.003 035 304 927 690 752;
  • 35) 0.003 035 304 927 690 752 × 2 = 0 + 0.006 070 609 855 381 504;
  • 36) 0.006 070 609 855 381 504 × 2 = 0 + 0.012 141 219 710 763 008;
  • 37) 0.012 141 219 710 763 008 × 2 = 0 + 0.024 282 439 421 526 016;
  • 38) 0.024 282 439 421 526 016 × 2 = 0 + 0.048 564 878 843 052 032;
  • 39) 0.048 564 878 843 052 032 × 2 = 0 + 0.097 129 757 686 104 064;
  • 40) 0.097 129 757 686 104 064 × 2 = 0 + 0.194 259 515 372 208 128;
  • 41) 0.194 259 515 372 208 128 × 2 = 0 + 0.388 519 030 744 416 256;
  • 42) 0.388 519 030 744 416 256 × 2 = 0 + 0.777 038 061 488 832 512;
  • 43) 0.777 038 061 488 832 512 × 2 = 1 + 0.554 076 122 977 665 024;
  • 44) 0.554 076 122 977 665 024 × 2 = 1 + 0.108 152 245 955 330 048;
  • 45) 0.108 152 245 955 330 048 × 2 = 0 + 0.216 304 491 910 660 096;
  • 46) 0.216 304 491 910 660 096 × 2 = 0 + 0.432 608 983 821 320 192;
  • 47) 0.432 608 983 821 320 192 × 2 = 0 + 0.865 217 967 642 640 384;
  • 48) 0.865 217 967 642 640 384 × 2 = 1 + 0.730 435 935 285 280 768;
  • 49) 0.730 435 935 285 280 768 × 2 = 1 + 0.460 871 870 570 561 536;
  • 50) 0.460 871 870 570 561 536 × 2 = 0 + 0.921 743 741 141 123 072;
  • 51) 0.921 743 741 141 123 072 × 2 = 1 + 0.843 487 482 282 246 144;
  • 52) 0.843 487 482 282 246 144 × 2 = 1 + 0.686 974 964 564 492 288;
  • 53) 0.686 974 964 564 492 288 × 2 = 1 + 0.373 949 929 128 984 576;
  • 54) 0.373 949 929 128 984 576 × 2 = 0 + 0.747 899 858 257 969 152;
  • 55) 0.747 899 858 257 969 152 × 2 = 1 + 0.495 799 716 515 938 304;
  • 56) 0.495 799 716 515 938 304 × 2 = 0 + 0.991 599 433 031 876 608;
  • 57) 0.991 599 433 031 876 608 × 2 = 1 + 0.983 198 866 063 753 216;
  • 58) 0.983 198 866 063 753 216 × 2 = 1 + 0.966 397 732 127 506 432;
  • 59) 0.966 397 732 127 506 432 × 2 = 1 + 0.932 795 464 255 012 864;
  • 60) 0.932 795 464 255 012 864 × 2 = 1 + 0.865 590 928 510 025 728;
  • 61) 0.865 590 928 510 025 728 × 2 = 1 + 0.731 181 857 020 051 456;
  • 62) 0.731 181 857 020 051 456 × 2 = 1 + 0.462 363 714 040 102 912;
  • 63) 0.462 363 714 040 102 912 × 2 = 0 + 0.924 727 428 080 205 824;
  • 64) 0.924 727 428 080 205 824 × 2 = 1 + 0.849 454 856 160 411 648;
  • 65) 0.849 454 856 160 411 648 × 2 = 1 + 0.698 909 712 320 823 296;
  • 66) 0.698 909 712 320 823 296 × 2 = 1 + 0.397 819 424 641 646 592;
  • 67) 0.397 819 424 641 646 592 × 2 = 0 + 0.795 638 849 283 293 184;
  • 68) 0.795 638 849 283 293 184 × 2 = 1 + 0.591 277 698 566 586 368;
  • 69) 0.591 277 698 566 586 368 × 2 = 1 + 0.182 555 397 133 172 736;
  • 70) 0.182 555 397 133 172 736 × 2 = 0 + 0.365 110 794 266 345 472;
  • 71) 0.365 110 794 266 345 472 × 2 = 0 + 0.730 221 588 532 690 944;
  • 72) 0.730 221 588 532 690 944 × 2 = 1 + 0.460 443 177 065 381 888;
  • 73) 0.460 443 177 065 381 888 × 2 = 0 + 0.920 886 354 130 763 776;
  • 74) 0.920 886 354 130 763 776 × 2 = 1 + 0.841 772 708 261 527 552;
  • 75) 0.841 772 708 261 527 552 × 2 = 1 + 0.683 545 416 523 055 104;
  • 76) 0.683 545 416 523 055 104 × 2 = 1 + 0.367 090 833 046 110 208;
  • 77) 0.367 090 833 046 110 208 × 2 = 0 + 0.734 181 666 092 220 416;
  • 78) 0.734 181 666 092 220 416 × 2 = 1 + 0.468 363 332 184 440 832;
  • 79) 0.468 363 332 184 440 832 × 2 = 0 + 0.936 726 664 368 881 664;
  • 80) 0.936 726 664 368 881 664 × 2 = 1 + 0.873 453 328 737 763 328;
  • 81) 0.873 453 328 737 763 328 × 2 = 1 + 0.746 906 657 475 526 656;
  • 82) 0.746 906 657 475 526 656 × 2 = 1 + 0.493 813 314 951 053 312;
  • 83) 0.493 813 314 951 053 312 × 2 = 0 + 0.987 626 629 902 106 624;
  • 84) 0.987 626 629 902 106 624 × 2 = 1 + 0.975 253 259 804 213 248;
  • 85) 0.975 253 259 804 213 248 × 2 = 1 + 0.950 506 519 608 426 496;
  • 86) 0.950 506 519 608 426 496 × 2 = 1 + 0.901 013 039 216 852 992;
  • 87) 0.901 013 039 216 852 992 × 2 = 1 + 0.802 026 078 433 705 984;
  • 88) 0.802 026 078 433 705 984 × 2 = 1 + 0.604 052 156 867 411 968;
  • 89) 0.604 052 156 867 411 968 × 2 = 1 + 0.208 104 313 734 823 936;
  • 90) 0.208 104 313 734 823 936 × 2 = 0 + 0.416 208 627 469 647 872;
  • 91) 0.416 208 627 469 647 872 × 2 = 0 + 0.832 417 254 939 295 744;
  • 92) 0.832 417 254 939 295 744 × 2 = 1 + 0.664 834 509 878 591 488;
  • 93) 0.664 834 509 878 591 488 × 2 = 1 + 0.329 669 019 757 182 976;
  • 94) 0.329 669 019 757 182 976 × 2 = 0 + 0.659 338 039 514 365 952;
  • 95) 0.659 338 039 514 365 952 × 2 = 1 + 0.318 676 079 028 731 904;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 1111 1101 1101 1001 0111 0101 1101 1111 1001 101(2)

6. Positive number before normalization:

0.000 000 000 000 176 678(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 1111 1101 1101 1001 0111 0101 1101 1111 1001 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 678(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 1111 1101 1101 1001 0111 0101 1101 1111 1001 101(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 1111 1101 1101 1001 0111 0101 1101 1111 1001 101(2) × 20 =

1.1000 1101 1101 0111 1110 1110 1100 1011 1010 1110 1111 1100 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 1101 0111 1110 1110 1100 1011 1010 1110 1111 1100 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 1101 0111 1110 1110 1100 1011 1010 1110 1111 1100 1101 =

1000 1101 1101 0111 1110 1110 1100 1011 1010 1110 1111 1100 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 1101 0111 1110 1110 1100 1011 1010 1110 1111 1100 1101


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

1 - 011 1101 0100 - 1000 1101 1101 0111 1110 1110 1100 1011 1010 1110 1111 1100 1101

Share

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