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

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


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

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 671 × 2 = 0 + 0.000 000 000 000 353 342;
  • 2) 0.000 000 000 000 353 342 × 2 = 0 + 0.000 000 000 000 706 684;
  • 3) 0.000 000 000 000 706 684 × 2 = 0 + 0.000 000 000 001 413 368;
  • 4) 0.000 000 000 001 413 368 × 2 = 0 + 0.000 000 000 002 826 736;
  • 5) 0.000 000 000 002 826 736 × 2 = 0 + 0.000 000 000 005 653 472;
  • 6) 0.000 000 000 005 653 472 × 2 = 0 + 0.000 000 000 011 306 944;
  • 7) 0.000 000 000 011 306 944 × 2 = 0 + 0.000 000 000 022 613 888;
  • 8) 0.000 000 000 022 613 888 × 2 = 0 + 0.000 000 000 045 227 776;
  • 9) 0.000 000 000 045 227 776 × 2 = 0 + 0.000 000 000 090 455 552;
  • 10) 0.000 000 000 090 455 552 × 2 = 0 + 0.000 000 000 180 911 104;
  • 11) 0.000 000 000 180 911 104 × 2 = 0 + 0.000 000 000 361 822 208;
  • 12) 0.000 000 000 361 822 208 × 2 = 0 + 0.000 000 000 723 644 416;
  • 13) 0.000 000 000 723 644 416 × 2 = 0 + 0.000 000 001 447 288 832;
  • 14) 0.000 000 001 447 288 832 × 2 = 0 + 0.000 000 002 894 577 664;
  • 15) 0.000 000 002 894 577 664 × 2 = 0 + 0.000 000 005 789 155 328;
  • 16) 0.000 000 005 789 155 328 × 2 = 0 + 0.000 000 011 578 310 656;
  • 17) 0.000 000 011 578 310 656 × 2 = 0 + 0.000 000 023 156 621 312;
  • 18) 0.000 000 023 156 621 312 × 2 = 0 + 0.000 000 046 313 242 624;
  • 19) 0.000 000 046 313 242 624 × 2 = 0 + 0.000 000 092 626 485 248;
  • 20) 0.000 000 092 626 485 248 × 2 = 0 + 0.000 000 185 252 970 496;
  • 21) 0.000 000 185 252 970 496 × 2 = 0 + 0.000 000 370 505 940 992;
  • 22) 0.000 000 370 505 940 992 × 2 = 0 + 0.000 000 741 011 881 984;
  • 23) 0.000 000 741 011 881 984 × 2 = 0 + 0.000 001 482 023 763 968;
  • 24) 0.000 001 482 023 763 968 × 2 = 0 + 0.000 002 964 047 527 936;
  • 25) 0.000 002 964 047 527 936 × 2 = 0 + 0.000 005 928 095 055 872;
  • 26) 0.000 005 928 095 055 872 × 2 = 0 + 0.000 011 856 190 111 744;
  • 27) 0.000 011 856 190 111 744 × 2 = 0 + 0.000 023 712 380 223 488;
  • 28) 0.000 023 712 380 223 488 × 2 = 0 + 0.000 047 424 760 446 976;
  • 29) 0.000 047 424 760 446 976 × 2 = 0 + 0.000 094 849 520 893 952;
  • 30) 0.000 094 849 520 893 952 × 2 = 0 + 0.000 189 699 041 787 904;
  • 31) 0.000 189 699 041 787 904 × 2 = 0 + 0.000 379 398 083 575 808;
  • 32) 0.000 379 398 083 575 808 × 2 = 0 + 0.000 758 796 167 151 616;
  • 33) 0.000 758 796 167 151 616 × 2 = 0 + 0.001 517 592 334 303 232;
  • 34) 0.001 517 592 334 303 232 × 2 = 0 + 0.003 035 184 668 606 464;
  • 35) 0.003 035 184 668 606 464 × 2 = 0 + 0.006 070 369 337 212 928;
  • 36) 0.006 070 369 337 212 928 × 2 = 0 + 0.012 140 738 674 425 856;
  • 37) 0.012 140 738 674 425 856 × 2 = 0 + 0.024 281 477 348 851 712;
  • 38) 0.024 281 477 348 851 712 × 2 = 0 + 0.048 562 954 697 703 424;
  • 39) 0.048 562 954 697 703 424 × 2 = 0 + 0.097 125 909 395 406 848;
  • 40) 0.097 125 909 395 406 848 × 2 = 0 + 0.194 251 818 790 813 696;
  • 41) 0.194 251 818 790 813 696 × 2 = 0 + 0.388 503 637 581 627 392;
  • 42) 0.388 503 637 581 627 392 × 2 = 0 + 0.777 007 275 163 254 784;
  • 43) 0.777 007 275 163 254 784 × 2 = 1 + 0.554 014 550 326 509 568;
  • 44) 0.554 014 550 326 509 568 × 2 = 1 + 0.108 029 100 653 019 136;
  • 45) 0.108 029 100 653 019 136 × 2 = 0 + 0.216 058 201 306 038 272;
  • 46) 0.216 058 201 306 038 272 × 2 = 0 + 0.432 116 402 612 076 544;
  • 47) 0.432 116 402 612 076 544 × 2 = 0 + 0.864 232 805 224 153 088;
  • 48) 0.864 232 805 224 153 088 × 2 = 1 + 0.728 465 610 448 306 176;
  • 49) 0.728 465 610 448 306 176 × 2 = 1 + 0.456 931 220 896 612 352;
  • 50) 0.456 931 220 896 612 352 × 2 = 0 + 0.913 862 441 793 224 704;
  • 51) 0.913 862 441 793 224 704 × 2 = 1 + 0.827 724 883 586 449 408;
  • 52) 0.827 724 883 586 449 408 × 2 = 1 + 0.655 449 767 172 898 816;
  • 53) 0.655 449 767 172 898 816 × 2 = 1 + 0.310 899 534 345 797 632;
  • 54) 0.310 899 534 345 797 632 × 2 = 0 + 0.621 799 068 691 595 264;
  • 55) 0.621 799 068 691 595 264 × 2 = 1 + 0.243 598 137 383 190 528;
  • 56) 0.243 598 137 383 190 528 × 2 = 0 + 0.487 196 274 766 381 056;
  • 57) 0.487 196 274 766 381 056 × 2 = 0 + 0.974 392 549 532 762 112;
  • 58) 0.974 392 549 532 762 112 × 2 = 1 + 0.948 785 099 065 524 224;
  • 59) 0.948 785 099 065 524 224 × 2 = 1 + 0.897 570 198 131 048 448;
  • 60) 0.897 570 198 131 048 448 × 2 = 1 + 0.795 140 396 262 096 896;
  • 61) 0.795 140 396 262 096 896 × 2 = 1 + 0.590 280 792 524 193 792;
  • 62) 0.590 280 792 524 193 792 × 2 = 1 + 0.180 561 585 048 387 584;
  • 63) 0.180 561 585 048 387 584 × 2 = 0 + 0.361 123 170 096 775 168;
  • 64) 0.361 123 170 096 775 168 × 2 = 0 + 0.722 246 340 193 550 336;
  • 65) 0.722 246 340 193 550 336 × 2 = 1 + 0.444 492 680 387 100 672;
  • 66) 0.444 492 680 387 100 672 × 2 = 0 + 0.888 985 360 774 201 344;
  • 67) 0.888 985 360 774 201 344 × 2 = 1 + 0.777 970 721 548 402 688;
  • 68) 0.777 970 721 548 402 688 × 2 = 1 + 0.555 941 443 096 805 376;
  • 69) 0.555 941 443 096 805 376 × 2 = 1 + 0.111 882 886 193 610 752;
  • 70) 0.111 882 886 193 610 752 × 2 = 0 + 0.223 765 772 387 221 504;
  • 71) 0.223 765 772 387 221 504 × 2 = 0 + 0.447 531 544 774 443 008;
  • 72) 0.447 531 544 774 443 008 × 2 = 0 + 0.895 063 089 548 886 016;
  • 73) 0.895 063 089 548 886 016 × 2 = 1 + 0.790 126 179 097 772 032;
  • 74) 0.790 126 179 097 772 032 × 2 = 1 + 0.580 252 358 195 544 064;
  • 75) 0.580 252 358 195 544 064 × 2 = 1 + 0.160 504 716 391 088 128;
  • 76) 0.160 504 716 391 088 128 × 2 = 0 + 0.321 009 432 782 176 256;
  • 77) 0.321 009 432 782 176 256 × 2 = 0 + 0.642 018 865 564 352 512;
  • 78) 0.642 018 865 564 352 512 × 2 = 1 + 0.284 037 731 128 705 024;
  • 79) 0.284 037 731 128 705 024 × 2 = 0 + 0.568 075 462 257 410 048;
  • 80) 0.568 075 462 257 410 048 × 2 = 1 + 0.136 150 924 514 820 096;
  • 81) 0.136 150 924 514 820 096 × 2 = 0 + 0.272 301 849 029 640 192;
  • 82) 0.272 301 849 029 640 192 × 2 = 0 + 0.544 603 698 059 280 384;
  • 83) 0.544 603 698 059 280 384 × 2 = 1 + 0.089 207 396 118 560 768;
  • 84) 0.089 207 396 118 560 768 × 2 = 0 + 0.178 414 792 237 121 536;
  • 85) 0.178 414 792 237 121 536 × 2 = 0 + 0.356 829 584 474 243 072;
  • 86) 0.356 829 584 474 243 072 × 2 = 0 + 0.713 659 168 948 486 144;
  • 87) 0.713 659 168 948 486 144 × 2 = 1 + 0.427 318 337 896 972 288;
  • 88) 0.427 318 337 896 972 288 × 2 = 0 + 0.854 636 675 793 944 576;
  • 89) 0.854 636 675 793 944 576 × 2 = 1 + 0.709 273 351 587 889 152;
  • 90) 0.709 273 351 587 889 152 × 2 = 1 + 0.418 546 703 175 778 304;
  • 91) 0.418 546 703 175 778 304 × 2 = 0 + 0.837 093 406 351 556 608;
  • 92) 0.837 093 406 351 556 608 × 2 = 1 + 0.674 186 812 703 113 216;
  • 93) 0.674 186 812 703 113 216 × 2 = 1 + 0.348 373 625 406 226 432;
  • 94) 0.348 373 625 406 226 432 × 2 = 0 + 0.696 747 250 812 452 864;
  • 95) 0.696 747 250 812 452 864 × 2 = 1 + 0.393 494 501 624 905 728;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 0111 1100 1011 1000 1110 0101 0010 0010 1101 101(2)

6. Positive number before normalization:

0.000 000 000 000 176 671(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 0111 1100 1011 1000 1110 0101 0010 0010 1101 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 671(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 0111 1100 1011 1000 1110 0101 0010 0010 1101 101(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 1010 0111 1100 1011 1000 1110 0101 0010 0010 1101 101(2) × 20 =

1.1000 1101 1101 0011 1110 0101 1100 0111 0010 1001 0001 0110 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 0011 1110 0101 1100 0111 0010 1001 0001 0110 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 0011 1110 0101 1100 0111 0010 1001 0001 0110 1101 =

1000 1101 1101 0011 1110 0101 1100 0111 0010 1001 0001 0110 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 0011 1110 0101 1100 0111 0010 1001 0001 0110 1101


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

1 - 011 1101 0100 - 1000 1101 1101 0011 1110 0101 1100 0111 0010 1001 0001 0110 1101

Share

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