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

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


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

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 592 × 2 = 0 + 0.000 000 000 000 353 184;
  • 2) 0.000 000 000 000 353 184 × 2 = 0 + 0.000 000 000 000 706 368;
  • 3) 0.000 000 000 000 706 368 × 2 = 0 + 0.000 000 000 001 412 736;
  • 4) 0.000 000 000 001 412 736 × 2 = 0 + 0.000 000 000 002 825 472;
  • 5) 0.000 000 000 002 825 472 × 2 = 0 + 0.000 000 000 005 650 944;
  • 6) 0.000 000 000 005 650 944 × 2 = 0 + 0.000 000 000 011 301 888;
  • 7) 0.000 000 000 011 301 888 × 2 = 0 + 0.000 000 000 022 603 776;
  • 8) 0.000 000 000 022 603 776 × 2 = 0 + 0.000 000 000 045 207 552;
  • 9) 0.000 000 000 045 207 552 × 2 = 0 + 0.000 000 000 090 415 104;
  • 10) 0.000 000 000 090 415 104 × 2 = 0 + 0.000 000 000 180 830 208;
  • 11) 0.000 000 000 180 830 208 × 2 = 0 + 0.000 000 000 361 660 416;
  • 12) 0.000 000 000 361 660 416 × 2 = 0 + 0.000 000 000 723 320 832;
  • 13) 0.000 000 000 723 320 832 × 2 = 0 + 0.000 000 001 446 641 664;
  • 14) 0.000 000 001 446 641 664 × 2 = 0 + 0.000 000 002 893 283 328;
  • 15) 0.000 000 002 893 283 328 × 2 = 0 + 0.000 000 005 786 566 656;
  • 16) 0.000 000 005 786 566 656 × 2 = 0 + 0.000 000 011 573 133 312;
  • 17) 0.000 000 011 573 133 312 × 2 = 0 + 0.000 000 023 146 266 624;
  • 18) 0.000 000 023 146 266 624 × 2 = 0 + 0.000 000 046 292 533 248;
  • 19) 0.000 000 046 292 533 248 × 2 = 0 + 0.000 000 092 585 066 496;
  • 20) 0.000 000 092 585 066 496 × 2 = 0 + 0.000 000 185 170 132 992;
  • 21) 0.000 000 185 170 132 992 × 2 = 0 + 0.000 000 370 340 265 984;
  • 22) 0.000 000 370 340 265 984 × 2 = 0 + 0.000 000 740 680 531 968;
  • 23) 0.000 000 740 680 531 968 × 2 = 0 + 0.000 001 481 361 063 936;
  • 24) 0.000 001 481 361 063 936 × 2 = 0 + 0.000 002 962 722 127 872;
  • 25) 0.000 002 962 722 127 872 × 2 = 0 + 0.000 005 925 444 255 744;
  • 26) 0.000 005 925 444 255 744 × 2 = 0 + 0.000 011 850 888 511 488;
  • 27) 0.000 011 850 888 511 488 × 2 = 0 + 0.000 023 701 777 022 976;
  • 28) 0.000 023 701 777 022 976 × 2 = 0 + 0.000 047 403 554 045 952;
  • 29) 0.000 047 403 554 045 952 × 2 = 0 + 0.000 094 807 108 091 904;
  • 30) 0.000 094 807 108 091 904 × 2 = 0 + 0.000 189 614 216 183 808;
  • 31) 0.000 189 614 216 183 808 × 2 = 0 + 0.000 379 228 432 367 616;
  • 32) 0.000 379 228 432 367 616 × 2 = 0 + 0.000 758 456 864 735 232;
  • 33) 0.000 758 456 864 735 232 × 2 = 0 + 0.001 516 913 729 470 464;
  • 34) 0.001 516 913 729 470 464 × 2 = 0 + 0.003 033 827 458 940 928;
  • 35) 0.003 033 827 458 940 928 × 2 = 0 + 0.006 067 654 917 881 856;
  • 36) 0.006 067 654 917 881 856 × 2 = 0 + 0.012 135 309 835 763 712;
  • 37) 0.012 135 309 835 763 712 × 2 = 0 + 0.024 270 619 671 527 424;
  • 38) 0.024 270 619 671 527 424 × 2 = 0 + 0.048 541 239 343 054 848;
  • 39) 0.048 541 239 343 054 848 × 2 = 0 + 0.097 082 478 686 109 696;
  • 40) 0.097 082 478 686 109 696 × 2 = 0 + 0.194 164 957 372 219 392;
  • 41) 0.194 164 957 372 219 392 × 2 = 0 + 0.388 329 914 744 438 784;
  • 42) 0.388 329 914 744 438 784 × 2 = 0 + 0.776 659 829 488 877 568;
  • 43) 0.776 659 829 488 877 568 × 2 = 1 + 0.553 319 658 977 755 136;
  • 44) 0.553 319 658 977 755 136 × 2 = 1 + 0.106 639 317 955 510 272;
  • 45) 0.106 639 317 955 510 272 × 2 = 0 + 0.213 278 635 911 020 544;
  • 46) 0.213 278 635 911 020 544 × 2 = 0 + 0.426 557 271 822 041 088;
  • 47) 0.426 557 271 822 041 088 × 2 = 0 + 0.853 114 543 644 082 176;
  • 48) 0.853 114 543 644 082 176 × 2 = 1 + 0.706 229 087 288 164 352;
  • 49) 0.706 229 087 288 164 352 × 2 = 1 + 0.412 458 174 576 328 704;
  • 50) 0.412 458 174 576 328 704 × 2 = 0 + 0.824 916 349 152 657 408;
  • 51) 0.824 916 349 152 657 408 × 2 = 1 + 0.649 832 698 305 314 816;
  • 52) 0.649 832 698 305 314 816 × 2 = 1 + 0.299 665 396 610 629 632;
  • 53) 0.299 665 396 610 629 632 × 2 = 0 + 0.599 330 793 221 259 264;
  • 54) 0.599 330 793 221 259 264 × 2 = 1 + 0.198 661 586 442 518 528;
  • 55) 0.198 661 586 442 518 528 × 2 = 0 + 0.397 323 172 885 037 056;
  • 56) 0.397 323 172 885 037 056 × 2 = 0 + 0.794 646 345 770 074 112;
  • 57) 0.794 646 345 770 074 112 × 2 = 1 + 0.589 292 691 540 148 224;
  • 58) 0.589 292 691 540 148 224 × 2 = 1 + 0.178 585 383 080 296 448;
  • 59) 0.178 585 383 080 296 448 × 2 = 0 + 0.357 170 766 160 592 896;
  • 60) 0.357 170 766 160 592 896 × 2 = 0 + 0.714 341 532 321 185 792;
  • 61) 0.714 341 532 321 185 792 × 2 = 1 + 0.428 683 064 642 371 584;
  • 62) 0.428 683 064 642 371 584 × 2 = 0 + 0.857 366 129 284 743 168;
  • 63) 0.857 366 129 284 743 168 × 2 = 1 + 0.714 732 258 569 486 336;
  • 64) 0.714 732 258 569 486 336 × 2 = 1 + 0.429 464 517 138 972 672;
  • 65) 0.429 464 517 138 972 672 × 2 = 0 + 0.858 929 034 277 945 344;
  • 66) 0.858 929 034 277 945 344 × 2 = 1 + 0.717 858 068 555 890 688;
  • 67) 0.717 858 068 555 890 688 × 2 = 1 + 0.435 716 137 111 781 376;
  • 68) 0.435 716 137 111 781 376 × 2 = 0 + 0.871 432 274 223 562 752;
  • 69) 0.871 432 274 223 562 752 × 2 = 1 + 0.742 864 548 447 125 504;
  • 70) 0.742 864 548 447 125 504 × 2 = 1 + 0.485 729 096 894 251 008;
  • 71) 0.485 729 096 894 251 008 × 2 = 0 + 0.971 458 193 788 502 016;
  • 72) 0.971 458 193 788 502 016 × 2 = 1 + 0.942 916 387 577 004 032;
  • 73) 0.942 916 387 577 004 032 × 2 = 1 + 0.885 832 775 154 008 064;
  • 74) 0.885 832 775 154 008 064 × 2 = 1 + 0.771 665 550 308 016 128;
  • 75) 0.771 665 550 308 016 128 × 2 = 1 + 0.543 331 100 616 032 256;
  • 76) 0.543 331 100 616 032 256 × 2 = 1 + 0.086 662 201 232 064 512;
  • 77) 0.086 662 201 232 064 512 × 2 = 0 + 0.173 324 402 464 129 024;
  • 78) 0.173 324 402 464 129 024 × 2 = 0 + 0.346 648 804 928 258 048;
  • 79) 0.346 648 804 928 258 048 × 2 = 0 + 0.693 297 609 856 516 096;
  • 80) 0.693 297 609 856 516 096 × 2 = 1 + 0.386 595 219 713 032 192;
  • 81) 0.386 595 219 713 032 192 × 2 = 0 + 0.773 190 439 426 064 384;
  • 82) 0.773 190 439 426 064 384 × 2 = 1 + 0.546 380 878 852 128 768;
  • 83) 0.546 380 878 852 128 768 × 2 = 1 + 0.092 761 757 704 257 536;
  • 84) 0.092 761 757 704 257 536 × 2 = 0 + 0.185 523 515 408 515 072;
  • 85) 0.185 523 515 408 515 072 × 2 = 0 + 0.371 047 030 817 030 144;
  • 86) 0.371 047 030 817 030 144 × 2 = 0 + 0.742 094 061 634 060 288;
  • 87) 0.742 094 061 634 060 288 × 2 = 1 + 0.484 188 123 268 120 576;
  • 88) 0.484 188 123 268 120 576 × 2 = 0 + 0.968 376 246 536 241 152;
  • 89) 0.968 376 246 536 241 152 × 2 = 1 + 0.936 752 493 072 482 304;
  • 90) 0.936 752 493 072 482 304 × 2 = 1 + 0.873 504 986 144 964 608;
  • 91) 0.873 504 986 144 964 608 × 2 = 1 + 0.747 009 972 289 929 216;
  • 92) 0.747 009 972 289 929 216 × 2 = 1 + 0.494 019 944 579 858 432;
  • 93) 0.494 019 944 579 858 432 × 2 = 0 + 0.988 039 889 159 716 864;
  • 94) 0.988 039 889 159 716 864 × 2 = 1 + 0.976 079 778 319 433 728;
  • 95) 0.976 079 778 319 433 728 × 2 = 1 + 0.952 159 556 638 867 456;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0100 1100 1011 0110 1101 1111 0001 0110 0010 1111 011(2)

6. Positive number before normalization:

0.000 000 000 000 176 592(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0100 1100 1011 0110 1101 1111 0001 0110 0010 1111 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 592(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0100 1100 1011 0110 1101 1111 0001 0110 0010 1111 011(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0011 0001 1011 0100 1100 1011 0110 1101 1111 0001 0110 0010 1111 011(2) × 20 =

1.1000 1101 1010 0110 0101 1011 0110 1111 1000 1011 0001 0111 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 1010 0110 0101 1011 0110 1111 1000 1011 0001 0111 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 1010 0110 0101 1011 0110 1111 1000 1011 0001 0111 1011 =

1000 1101 1010 0110 0101 1011 0110 1111 1000 1011 0001 0111 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 1010 0110 0101 1011 0110 1111 1000 1011 0001 0111 1011


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

1 - 011 1101 0100 - 1000 1101 1010 0110 0101 1011 0110 1111 1000 1011 0001 0111 1011

Share

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