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

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


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

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 674 × 2 = 0 + 0.000 000 000 000 353 348;
  • 2) 0.000 000 000 000 353 348 × 2 = 0 + 0.000 000 000 000 706 696;
  • 3) 0.000 000 000 000 706 696 × 2 = 0 + 0.000 000 000 001 413 392;
  • 4) 0.000 000 000 001 413 392 × 2 = 0 + 0.000 000 000 002 826 784;
  • 5) 0.000 000 000 002 826 784 × 2 = 0 + 0.000 000 000 005 653 568;
  • 6) 0.000 000 000 005 653 568 × 2 = 0 + 0.000 000 000 011 307 136;
  • 7) 0.000 000 000 011 307 136 × 2 = 0 + 0.000 000 000 022 614 272;
  • 8) 0.000 000 000 022 614 272 × 2 = 0 + 0.000 000 000 045 228 544;
  • 9) 0.000 000 000 045 228 544 × 2 = 0 + 0.000 000 000 090 457 088;
  • 10) 0.000 000 000 090 457 088 × 2 = 0 + 0.000 000 000 180 914 176;
  • 11) 0.000 000 000 180 914 176 × 2 = 0 + 0.000 000 000 361 828 352;
  • 12) 0.000 000 000 361 828 352 × 2 = 0 + 0.000 000 000 723 656 704;
  • 13) 0.000 000 000 723 656 704 × 2 = 0 + 0.000 000 001 447 313 408;
  • 14) 0.000 000 001 447 313 408 × 2 = 0 + 0.000 000 002 894 626 816;
  • 15) 0.000 000 002 894 626 816 × 2 = 0 + 0.000 000 005 789 253 632;
  • 16) 0.000 000 005 789 253 632 × 2 = 0 + 0.000 000 011 578 507 264;
  • 17) 0.000 000 011 578 507 264 × 2 = 0 + 0.000 000 023 157 014 528;
  • 18) 0.000 000 023 157 014 528 × 2 = 0 + 0.000 000 046 314 029 056;
  • 19) 0.000 000 046 314 029 056 × 2 = 0 + 0.000 000 092 628 058 112;
  • 20) 0.000 000 092 628 058 112 × 2 = 0 + 0.000 000 185 256 116 224;
  • 21) 0.000 000 185 256 116 224 × 2 = 0 + 0.000 000 370 512 232 448;
  • 22) 0.000 000 370 512 232 448 × 2 = 0 + 0.000 000 741 024 464 896;
  • 23) 0.000 000 741 024 464 896 × 2 = 0 + 0.000 001 482 048 929 792;
  • 24) 0.000 001 482 048 929 792 × 2 = 0 + 0.000 002 964 097 859 584;
  • 25) 0.000 002 964 097 859 584 × 2 = 0 + 0.000 005 928 195 719 168;
  • 26) 0.000 005 928 195 719 168 × 2 = 0 + 0.000 011 856 391 438 336;
  • 27) 0.000 011 856 391 438 336 × 2 = 0 + 0.000 023 712 782 876 672;
  • 28) 0.000 023 712 782 876 672 × 2 = 0 + 0.000 047 425 565 753 344;
  • 29) 0.000 047 425 565 753 344 × 2 = 0 + 0.000 094 851 131 506 688;
  • 30) 0.000 094 851 131 506 688 × 2 = 0 + 0.000 189 702 263 013 376;
  • 31) 0.000 189 702 263 013 376 × 2 = 0 + 0.000 379 404 526 026 752;
  • 32) 0.000 379 404 526 026 752 × 2 = 0 + 0.000 758 809 052 053 504;
  • 33) 0.000 758 809 052 053 504 × 2 = 0 + 0.001 517 618 104 107 008;
  • 34) 0.001 517 618 104 107 008 × 2 = 0 + 0.003 035 236 208 214 016;
  • 35) 0.003 035 236 208 214 016 × 2 = 0 + 0.006 070 472 416 428 032;
  • 36) 0.006 070 472 416 428 032 × 2 = 0 + 0.012 140 944 832 856 064;
  • 37) 0.012 140 944 832 856 064 × 2 = 0 + 0.024 281 889 665 712 128;
  • 38) 0.024 281 889 665 712 128 × 2 = 0 + 0.048 563 779 331 424 256;
  • 39) 0.048 563 779 331 424 256 × 2 = 0 + 0.097 127 558 662 848 512;
  • 40) 0.097 127 558 662 848 512 × 2 = 0 + 0.194 255 117 325 697 024;
  • 41) 0.194 255 117 325 697 024 × 2 = 0 + 0.388 510 234 651 394 048;
  • 42) 0.388 510 234 651 394 048 × 2 = 0 + 0.777 020 469 302 788 096;
  • 43) 0.777 020 469 302 788 096 × 2 = 1 + 0.554 040 938 605 576 192;
  • 44) 0.554 040 938 605 576 192 × 2 = 1 + 0.108 081 877 211 152 384;
  • 45) 0.108 081 877 211 152 384 × 2 = 0 + 0.216 163 754 422 304 768;
  • 46) 0.216 163 754 422 304 768 × 2 = 0 + 0.432 327 508 844 609 536;
  • 47) 0.432 327 508 844 609 536 × 2 = 0 + 0.864 655 017 689 219 072;
  • 48) 0.864 655 017 689 219 072 × 2 = 1 + 0.729 310 035 378 438 144;
  • 49) 0.729 310 035 378 438 144 × 2 = 1 + 0.458 620 070 756 876 288;
  • 50) 0.458 620 070 756 876 288 × 2 = 0 + 0.917 240 141 513 752 576;
  • 51) 0.917 240 141 513 752 576 × 2 = 1 + 0.834 480 283 027 505 152;
  • 52) 0.834 480 283 027 505 152 × 2 = 1 + 0.668 960 566 055 010 304;
  • 53) 0.668 960 566 055 010 304 × 2 = 1 + 0.337 921 132 110 020 608;
  • 54) 0.337 921 132 110 020 608 × 2 = 0 + 0.675 842 264 220 041 216;
  • 55) 0.675 842 264 220 041 216 × 2 = 1 + 0.351 684 528 440 082 432;
  • 56) 0.351 684 528 440 082 432 × 2 = 0 + 0.703 369 056 880 164 864;
  • 57) 0.703 369 056 880 164 864 × 2 = 1 + 0.406 738 113 760 329 728;
  • 58) 0.406 738 113 760 329 728 × 2 = 0 + 0.813 476 227 520 659 456;
  • 59) 0.813 476 227 520 659 456 × 2 = 1 + 0.626 952 455 041 318 912;
  • 60) 0.626 952 455 041 318 912 × 2 = 1 + 0.253 904 910 082 637 824;
  • 61) 0.253 904 910 082 637 824 × 2 = 0 + 0.507 809 820 165 275 648;
  • 62) 0.507 809 820 165 275 648 × 2 = 1 + 0.015 619 640 330 551 296;
  • 63) 0.015 619 640 330 551 296 × 2 = 0 + 0.031 239 280 661 102 592;
  • 64) 0.031 239 280 661 102 592 × 2 = 0 + 0.062 478 561 322 205 184;
  • 65) 0.062 478 561 322 205 184 × 2 = 0 + 0.124 957 122 644 410 368;
  • 66) 0.124 957 122 644 410 368 × 2 = 0 + 0.249 914 245 288 820 736;
  • 67) 0.249 914 245 288 820 736 × 2 = 0 + 0.499 828 490 577 641 472;
  • 68) 0.499 828 490 577 641 472 × 2 = 0 + 0.999 656 981 155 282 944;
  • 69) 0.999 656 981 155 282 944 × 2 = 1 + 0.999 313 962 310 565 888;
  • 70) 0.999 313 962 310 565 888 × 2 = 1 + 0.998 627 924 621 131 776;
  • 71) 0.998 627 924 621 131 776 × 2 = 1 + 0.997 255 849 242 263 552;
  • 72) 0.997 255 849 242 263 552 × 2 = 1 + 0.994 511 698 484 527 104;
  • 73) 0.994 511 698 484 527 104 × 2 = 1 + 0.989 023 396 969 054 208;
  • 74) 0.989 023 396 969 054 208 × 2 = 1 + 0.978 046 793 938 108 416;
  • 75) 0.978 046 793 938 108 416 × 2 = 1 + 0.956 093 587 876 216 832;
  • 76) 0.956 093 587 876 216 832 × 2 = 1 + 0.912 187 175 752 433 664;
  • 77) 0.912 187 175 752 433 664 × 2 = 1 + 0.824 374 351 504 867 328;
  • 78) 0.824 374 351 504 867 328 × 2 = 1 + 0.648 748 703 009 734 656;
  • 79) 0.648 748 703 009 734 656 × 2 = 1 + 0.297 497 406 019 469 312;
  • 80) 0.297 497 406 019 469 312 × 2 = 0 + 0.594 994 812 038 938 624;
  • 81) 0.594 994 812 038 938 624 × 2 = 1 + 0.189 989 624 077 877 248;
  • 82) 0.189 989 624 077 877 248 × 2 = 0 + 0.379 979 248 155 754 496;
  • 83) 0.379 979 248 155 754 496 × 2 = 0 + 0.759 958 496 311 508 992;
  • 84) 0.759 958 496 311 508 992 × 2 = 1 + 0.519 916 992 623 017 984;
  • 85) 0.519 916 992 623 017 984 × 2 = 1 + 0.039 833 985 246 035 968;
  • 86) 0.039 833 985 246 035 968 × 2 = 0 + 0.079 667 970 492 071 936;
  • 87) 0.079 667 970 492 071 936 × 2 = 0 + 0.159 335 940 984 143 872;
  • 88) 0.159 335 940 984 143 872 × 2 = 0 + 0.318 671 881 968 287 744;
  • 89) 0.318 671 881 968 287 744 × 2 = 0 + 0.637 343 763 936 575 488;
  • 90) 0.637 343 763 936 575 488 × 2 = 1 + 0.274 687 527 873 150 976;
  • 91) 0.274 687 527 873 150 976 × 2 = 0 + 0.549 375 055 746 301 952;
  • 92) 0.549 375 055 746 301 952 × 2 = 1 + 0.098 750 111 492 603 904;
  • 93) 0.098 750 111 492 603 904 × 2 = 0 + 0.197 500 222 985 207 808;
  • 94) 0.197 500 222 985 207 808 × 2 = 0 + 0.395 000 445 970 415 616;
  • 95) 0.395 000 445 970 415 616 × 2 = 0 + 0.790 000 891 940 831 232;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 1011 0100 0000 1111 1111 1110 1001 1000 0101 000(2)

6. Positive number before normalization:

0.000 000 000 000 176 674(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 1011 0100 0000 1111 1111 1110 1001 1000 0101 000(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 674(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 1011 0100 0000 1111 1111 1110 1001 1000 0101 000(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 1011 0100 0000 1111 1111 1110 1001 1000 0101 000(2) × 20 =

1.1000 1101 1101 0101 1010 0000 0111 1111 1111 0100 1100 0010 1000(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 0101 1010 0000 0111 1111 1111 0100 1100 0010 1000


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 0101 1010 0000 0111 1111 1111 0100 1100 0010 1000 =

1000 1101 1101 0101 1010 0000 0111 1111 1111 0100 1100 0010 1000


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 0101 1010 0000 0111 1111 1111 0100 1100 0010 1000


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

1 - 011 1101 0100 - 1000 1101 1101 0101 1010 0000 0111 1111 1111 0100 1100 0010 1000

Share

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