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

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


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

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 627 × 2 = 0 + 0.000 000 000 000 353 254;
  • 2) 0.000 000 000 000 353 254 × 2 = 0 + 0.000 000 000 000 706 508;
  • 3) 0.000 000 000 000 706 508 × 2 = 0 + 0.000 000 000 001 413 016;
  • 4) 0.000 000 000 001 413 016 × 2 = 0 + 0.000 000 000 002 826 032;
  • 5) 0.000 000 000 002 826 032 × 2 = 0 + 0.000 000 000 005 652 064;
  • 6) 0.000 000 000 005 652 064 × 2 = 0 + 0.000 000 000 011 304 128;
  • 7) 0.000 000 000 011 304 128 × 2 = 0 + 0.000 000 000 022 608 256;
  • 8) 0.000 000 000 022 608 256 × 2 = 0 + 0.000 000 000 045 216 512;
  • 9) 0.000 000 000 045 216 512 × 2 = 0 + 0.000 000 000 090 433 024;
  • 10) 0.000 000 000 090 433 024 × 2 = 0 + 0.000 000 000 180 866 048;
  • 11) 0.000 000 000 180 866 048 × 2 = 0 + 0.000 000 000 361 732 096;
  • 12) 0.000 000 000 361 732 096 × 2 = 0 + 0.000 000 000 723 464 192;
  • 13) 0.000 000 000 723 464 192 × 2 = 0 + 0.000 000 001 446 928 384;
  • 14) 0.000 000 001 446 928 384 × 2 = 0 + 0.000 000 002 893 856 768;
  • 15) 0.000 000 002 893 856 768 × 2 = 0 + 0.000 000 005 787 713 536;
  • 16) 0.000 000 005 787 713 536 × 2 = 0 + 0.000 000 011 575 427 072;
  • 17) 0.000 000 011 575 427 072 × 2 = 0 + 0.000 000 023 150 854 144;
  • 18) 0.000 000 023 150 854 144 × 2 = 0 + 0.000 000 046 301 708 288;
  • 19) 0.000 000 046 301 708 288 × 2 = 0 + 0.000 000 092 603 416 576;
  • 20) 0.000 000 092 603 416 576 × 2 = 0 + 0.000 000 185 206 833 152;
  • 21) 0.000 000 185 206 833 152 × 2 = 0 + 0.000 000 370 413 666 304;
  • 22) 0.000 000 370 413 666 304 × 2 = 0 + 0.000 000 740 827 332 608;
  • 23) 0.000 000 740 827 332 608 × 2 = 0 + 0.000 001 481 654 665 216;
  • 24) 0.000 001 481 654 665 216 × 2 = 0 + 0.000 002 963 309 330 432;
  • 25) 0.000 002 963 309 330 432 × 2 = 0 + 0.000 005 926 618 660 864;
  • 26) 0.000 005 926 618 660 864 × 2 = 0 + 0.000 011 853 237 321 728;
  • 27) 0.000 011 853 237 321 728 × 2 = 0 + 0.000 023 706 474 643 456;
  • 28) 0.000 023 706 474 643 456 × 2 = 0 + 0.000 047 412 949 286 912;
  • 29) 0.000 047 412 949 286 912 × 2 = 0 + 0.000 094 825 898 573 824;
  • 30) 0.000 094 825 898 573 824 × 2 = 0 + 0.000 189 651 797 147 648;
  • 31) 0.000 189 651 797 147 648 × 2 = 0 + 0.000 379 303 594 295 296;
  • 32) 0.000 379 303 594 295 296 × 2 = 0 + 0.000 758 607 188 590 592;
  • 33) 0.000 758 607 188 590 592 × 2 = 0 + 0.001 517 214 377 181 184;
  • 34) 0.001 517 214 377 181 184 × 2 = 0 + 0.003 034 428 754 362 368;
  • 35) 0.003 034 428 754 362 368 × 2 = 0 + 0.006 068 857 508 724 736;
  • 36) 0.006 068 857 508 724 736 × 2 = 0 + 0.012 137 715 017 449 472;
  • 37) 0.012 137 715 017 449 472 × 2 = 0 + 0.024 275 430 034 898 944;
  • 38) 0.024 275 430 034 898 944 × 2 = 0 + 0.048 550 860 069 797 888;
  • 39) 0.048 550 860 069 797 888 × 2 = 0 + 0.097 101 720 139 595 776;
  • 40) 0.097 101 720 139 595 776 × 2 = 0 + 0.194 203 440 279 191 552;
  • 41) 0.194 203 440 279 191 552 × 2 = 0 + 0.388 406 880 558 383 104;
  • 42) 0.388 406 880 558 383 104 × 2 = 0 + 0.776 813 761 116 766 208;
  • 43) 0.776 813 761 116 766 208 × 2 = 1 + 0.553 627 522 233 532 416;
  • 44) 0.553 627 522 233 532 416 × 2 = 1 + 0.107 255 044 467 064 832;
  • 45) 0.107 255 044 467 064 832 × 2 = 0 + 0.214 510 088 934 129 664;
  • 46) 0.214 510 088 934 129 664 × 2 = 0 + 0.429 020 177 868 259 328;
  • 47) 0.429 020 177 868 259 328 × 2 = 0 + 0.858 040 355 736 518 656;
  • 48) 0.858 040 355 736 518 656 × 2 = 1 + 0.716 080 711 473 037 312;
  • 49) 0.716 080 711 473 037 312 × 2 = 1 + 0.432 161 422 946 074 624;
  • 50) 0.432 161 422 946 074 624 × 2 = 0 + 0.864 322 845 892 149 248;
  • 51) 0.864 322 845 892 149 248 × 2 = 1 + 0.728 645 691 784 298 496;
  • 52) 0.728 645 691 784 298 496 × 2 = 1 + 0.457 291 383 568 596 992;
  • 53) 0.457 291 383 568 596 992 × 2 = 0 + 0.914 582 767 137 193 984;
  • 54) 0.914 582 767 137 193 984 × 2 = 1 + 0.829 165 534 274 387 968;
  • 55) 0.829 165 534 274 387 968 × 2 = 1 + 0.658 331 068 548 775 936;
  • 56) 0.658 331 068 548 775 936 × 2 = 1 + 0.316 662 137 097 551 872;
  • 57) 0.316 662 137 097 551 872 × 2 = 0 + 0.633 324 274 195 103 744;
  • 58) 0.633 324 274 195 103 744 × 2 = 1 + 0.266 648 548 390 207 488;
  • 59) 0.266 648 548 390 207 488 × 2 = 0 + 0.533 297 096 780 414 976;
  • 60) 0.533 297 096 780 414 976 × 2 = 1 + 0.066 594 193 560 829 952;
  • 61) 0.066 594 193 560 829 952 × 2 = 0 + 0.133 188 387 121 659 904;
  • 62) 0.133 188 387 121 659 904 × 2 = 0 + 0.266 376 774 243 319 808;
  • 63) 0.266 376 774 243 319 808 × 2 = 0 + 0.532 753 548 486 639 616;
  • 64) 0.532 753 548 486 639 616 × 2 = 1 + 0.065 507 096 973 279 232;
  • 65) 0.065 507 096 973 279 232 × 2 = 0 + 0.131 014 193 946 558 464;
  • 66) 0.131 014 193 946 558 464 × 2 = 0 + 0.262 028 387 893 116 928;
  • 67) 0.262 028 387 893 116 928 × 2 = 0 + 0.524 056 775 786 233 856;
  • 68) 0.524 056 775 786 233 856 × 2 = 1 + 0.048 113 551 572 467 712;
  • 69) 0.048 113 551 572 467 712 × 2 = 0 + 0.096 227 103 144 935 424;
  • 70) 0.096 227 103 144 935 424 × 2 = 0 + 0.192 454 206 289 870 848;
  • 71) 0.192 454 206 289 870 848 × 2 = 0 + 0.384 908 412 579 741 696;
  • 72) 0.384 908 412 579 741 696 × 2 = 0 + 0.769 816 825 159 483 392;
  • 73) 0.769 816 825 159 483 392 × 2 = 1 + 0.539 633 650 318 966 784;
  • 74) 0.539 633 650 318 966 784 × 2 = 1 + 0.079 267 300 637 933 568;
  • 75) 0.079 267 300 637 933 568 × 2 = 0 + 0.158 534 601 275 867 136;
  • 76) 0.158 534 601 275 867 136 × 2 = 0 + 0.317 069 202 551 734 272;
  • 77) 0.317 069 202 551 734 272 × 2 = 0 + 0.634 138 405 103 468 544;
  • 78) 0.634 138 405 103 468 544 × 2 = 1 + 0.268 276 810 206 937 088;
  • 79) 0.268 276 810 206 937 088 × 2 = 0 + 0.536 553 620 413 874 176;
  • 80) 0.536 553 620 413 874 176 × 2 = 1 + 0.073 107 240 827 748 352;
  • 81) 0.073 107 240 827 748 352 × 2 = 0 + 0.146 214 481 655 496 704;
  • 82) 0.146 214 481 655 496 704 × 2 = 0 + 0.292 428 963 310 993 408;
  • 83) 0.292 428 963 310 993 408 × 2 = 0 + 0.584 857 926 621 986 816;
  • 84) 0.584 857 926 621 986 816 × 2 = 1 + 0.169 715 853 243 973 632;
  • 85) 0.169 715 853 243 973 632 × 2 = 0 + 0.339 431 706 487 947 264;
  • 86) 0.339 431 706 487 947 264 × 2 = 0 + 0.678 863 412 975 894 528;
  • 87) 0.678 863 412 975 894 528 × 2 = 1 + 0.357 726 825 951 789 056;
  • 88) 0.357 726 825 951 789 056 × 2 = 0 + 0.715 453 651 903 578 112;
  • 89) 0.715 453 651 903 578 112 × 2 = 1 + 0.430 907 303 807 156 224;
  • 90) 0.430 907 303 807 156 224 × 2 = 0 + 0.861 814 607 614 312 448;
  • 91) 0.861 814 607 614 312 448 × 2 = 1 + 0.723 629 215 228 624 896;
  • 92) 0.723 629 215 228 624 896 × 2 = 1 + 0.447 258 430 457 249 792;
  • 93) 0.447 258 430 457 249 792 × 2 = 0 + 0.894 516 860 914 499 584;
  • 94) 0.894 516 860 914 499 584 × 2 = 1 + 0.789 033 721 828 999 168;
  • 95) 0.789 033 721 828 999 168 × 2 = 1 + 0.578 067 443 657 998 336;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0111 0101 0001 0001 0000 1100 0101 0001 0010 1011 011(2)

6. Positive number before normalization:

0.000 000 000 000 176 627(10) =

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0111 0101 0001 0001 0000 1100 0101 0001 0010 1011 011(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0111 0101 0001 0001 0000 1100 0101 0001 0010 1011 011(2) × 20 =

1.1000 1101 1011 1010 1000 1000 1000 0110 0010 1000 1001 0101 1011(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 1011 1010 1000 1000 1000 0110 0010 1000 1001 0101 1011


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 1011 1010 1000 1000 1000 0110 0010 1000 1001 0101 1011 =

1000 1101 1011 1010 1000 1000 1000 0110 0010 1000 1001 0101 1011


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 1011 1010 1000 1000 1000 0110 0010 1000 1001 0101 1011


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

1 - 011 1101 0100 - 1000 1101 1011 1010 1000 1000 1000 0110 0010 1000 1001 0101 1011

Share

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