-81 869.602 684 384 910 389 780 66 Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal -81 869.602 684 384 910 389 780 66(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
-81 869.602 684 384 910 389 780 66(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:

|-81 869.602 684 384 910 389 780 66| = 81 869.602 684 384 910 389 780 66


2. First, convert to binary (in base 2) the integer part: 81 869.
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;
  • 81 869 ÷ 2 = 40 934 + 1;
  • 40 934 ÷ 2 = 20 467 + 0;
  • 20 467 ÷ 2 = 10 233 + 1;
  • 10 233 ÷ 2 = 5 116 + 1;
  • 5 116 ÷ 2 = 2 558 + 0;
  • 2 558 ÷ 2 = 1 279 + 0;
  • 1 279 ÷ 2 = 639 + 1;
  • 639 ÷ 2 = 319 + 1;
  • 319 ÷ 2 = 159 + 1;
  • 159 ÷ 2 = 79 + 1;
  • 79 ÷ 2 = 39 + 1;
  • 39 ÷ 2 = 19 + 1;
  • 19 ÷ 2 = 9 + 1;
  • 9 ÷ 2 = 4 + 1;
  • 4 ÷ 2 = 2 + 0;
  • 2 ÷ 2 = 1 + 0;
  • 1 ÷ 2 = 0 + 1;

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.

81 869(10) =

1 0011 1111 1100 1101(2)


4. Convert to binary (base 2) the fractional part: 0.602 684 384 910 389 780 66.

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.602 684 384 910 389 780 66 × 2 = 1 + 0.205 368 769 820 779 561 32;
  • 2) 0.205 368 769 820 779 561 32 × 2 = 0 + 0.410 737 539 641 559 122 64;
  • 3) 0.410 737 539 641 559 122 64 × 2 = 0 + 0.821 475 079 283 118 245 28;
  • 4) 0.821 475 079 283 118 245 28 × 2 = 1 + 0.642 950 158 566 236 490 56;
  • 5) 0.642 950 158 566 236 490 56 × 2 = 1 + 0.285 900 317 132 472 981 12;
  • 6) 0.285 900 317 132 472 981 12 × 2 = 0 + 0.571 800 634 264 945 962 24;
  • 7) 0.571 800 634 264 945 962 24 × 2 = 1 + 0.143 601 268 529 891 924 48;
  • 8) 0.143 601 268 529 891 924 48 × 2 = 0 + 0.287 202 537 059 783 848 96;
  • 9) 0.287 202 537 059 783 848 96 × 2 = 0 + 0.574 405 074 119 567 697 92;
  • 10) 0.574 405 074 119 567 697 92 × 2 = 1 + 0.148 810 148 239 135 395 84;
  • 11) 0.148 810 148 239 135 395 84 × 2 = 0 + 0.297 620 296 478 270 791 68;
  • 12) 0.297 620 296 478 270 791 68 × 2 = 0 + 0.595 240 592 956 541 583 36;
  • 13) 0.595 240 592 956 541 583 36 × 2 = 1 + 0.190 481 185 913 083 166 72;
  • 14) 0.190 481 185 913 083 166 72 × 2 = 0 + 0.380 962 371 826 166 333 44;
  • 15) 0.380 962 371 826 166 333 44 × 2 = 0 + 0.761 924 743 652 332 666 88;
  • 16) 0.761 924 743 652 332 666 88 × 2 = 1 + 0.523 849 487 304 665 333 76;
  • 17) 0.523 849 487 304 665 333 76 × 2 = 1 + 0.047 698 974 609 330 667 52;
  • 18) 0.047 698 974 609 330 667 52 × 2 = 0 + 0.095 397 949 218 661 335 04;
  • 19) 0.095 397 949 218 661 335 04 × 2 = 0 + 0.190 795 898 437 322 670 08;
  • 20) 0.190 795 898 437 322 670 08 × 2 = 0 + 0.381 591 796 874 645 340 16;
  • 21) 0.381 591 796 874 645 340 16 × 2 = 0 + 0.763 183 593 749 290 680 32;
  • 22) 0.763 183 593 749 290 680 32 × 2 = 1 + 0.526 367 187 498 581 360 64;
  • 23) 0.526 367 187 498 581 360 64 × 2 = 1 + 0.052 734 374 997 162 721 28;
  • 24) 0.052 734 374 997 162 721 28 × 2 = 0 + 0.105 468 749 994 325 442 56;
  • 25) 0.105 468 749 994 325 442 56 × 2 = 0 + 0.210 937 499 988 650 885 12;
  • 26) 0.210 937 499 988 650 885 12 × 2 = 0 + 0.421 874 999 977 301 770 24;
  • 27) 0.421 874 999 977 301 770 24 × 2 = 0 + 0.843 749 999 954 603 540 48;
  • 28) 0.843 749 999 954 603 540 48 × 2 = 1 + 0.687 499 999 909 207 080 96;
  • 29) 0.687 499 999 909 207 080 96 × 2 = 1 + 0.374 999 999 818 414 161 92;
  • 30) 0.374 999 999 818 414 161 92 × 2 = 0 + 0.749 999 999 636 828 323 84;
  • 31) 0.749 999 999 636 828 323 84 × 2 = 1 + 0.499 999 999 273 656 647 68;
  • 32) 0.499 999 999 273 656 647 68 × 2 = 0 + 0.999 999 998 547 313 295 36;
  • 33) 0.999 999 998 547 313 295 36 × 2 = 1 + 0.999 999 997 094 626 590 72;
  • 34) 0.999 999 997 094 626 590 72 × 2 = 1 + 0.999 999 994 189 253 181 44;
  • 35) 0.999 999 994 189 253 181 44 × 2 = 1 + 0.999 999 988 378 506 362 88;
  • 36) 0.999 999 988 378 506 362 88 × 2 = 1 + 0.999 999 976 757 012 725 76;
  • 37) 0.999 999 976 757 012 725 76 × 2 = 1 + 0.999 999 953 514 025 451 52;
  • 38) 0.999 999 953 514 025 451 52 × 2 = 1 + 0.999 999 907 028 050 903 04;
  • 39) 0.999 999 907 028 050 903 04 × 2 = 1 + 0.999 999 814 056 101 806 08;
  • 40) 0.999 999 814 056 101 806 08 × 2 = 1 + 0.999 999 628 112 203 612 16;
  • 41) 0.999 999 628 112 203 612 16 × 2 = 1 + 0.999 999 256 224 407 224 32;
  • 42) 0.999 999 256 224 407 224 32 × 2 = 1 + 0.999 998 512 448 814 448 64;
  • 43) 0.999 998 512 448 814 448 64 × 2 = 1 + 0.999 997 024 897 628 897 28;
  • 44) 0.999 997 024 897 628 897 28 × 2 = 1 + 0.999 994 049 795 257 794 56;
  • 45) 0.999 994 049 795 257 794 56 × 2 = 1 + 0.999 988 099 590 515 589 12;
  • 46) 0.999 988 099 590 515 589 12 × 2 = 1 + 0.999 976 199 181 031 178 24;
  • 47) 0.999 976 199 181 031 178 24 × 2 = 1 + 0.999 952 398 362 062 356 48;
  • 48) 0.999 952 398 362 062 356 48 × 2 = 1 + 0.999 904 796 724 124 712 96;
  • 49) 0.999 904 796 724 124 712 96 × 2 = 1 + 0.999 809 593 448 249 425 92;
  • 50) 0.999 809 593 448 249 425 92 × 2 = 1 + 0.999 619 186 896 498 851 84;
  • 51) 0.999 619 186 896 498 851 84 × 2 = 1 + 0.999 238 373 792 997 703 68;
  • 52) 0.999 238 373 792 997 703 68 × 2 = 1 + 0.998 476 747 585 995 407 36;
  • 53) 0.998 476 747 585 995 407 36 × 2 = 1 + 0.996 953 495 171 990 814 72;

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.602 684 384 910 389 780 66(10) =

0.1001 1010 0100 1001 1000 0110 0001 1010 1111 1111 1111 1111 1111 1(2)

6. Positive number before normalization:

81 869.602 684 384 910 389 780 66(10) =

1 0011 1111 1100 1101.1001 1010 0100 1001 1000 0110 0001 1010 1111 1111 1111 1111 1111 1(2)

7. Normalize the binary representation of the number.

Shift the decimal mark 16 positions to the left, so that only one non zero digit remains to the left of it:


81 869.602 684 384 910 389 780 66(10) =

1 0011 1111 1100 1101.1001 1010 0100 1001 1000 0110 0001 1010 1111 1111 1111 1111 1111 1(2) =

1 0011 1111 1100 1101.1001 1010 0100 1001 1000 0110 0001 1010 1111 1111 1111 1111 1111 1(2) × 20 =

1.0011 1111 1100 1101 1001 1010 0100 1001 1000 0110 0001 1010 1111 1111 1111 1111 1111 1(2) × 216


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): 16

Mantissa (not normalized):
1.0011 1111 1100 1101 1001 1010 0100 1001 1000 0110 0001 1010 1111 1111 1111 1111 1111 1


9. Adjust the exponent.

Use the 11 bit excess/bias notation:


Exponent (adjusted) =

Exponent (unadjusted) + 2(11-1) - 1 =

16 + 2(11-1) - 1 =

(16 + 1 023)(10) =

1 039(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;
  • 1 039 ÷ 2 = 519 + 1;
  • 519 ÷ 2 = 259 + 1;
  • 259 ÷ 2 = 129 + 1;
  • 129 ÷ 2 = 64 + 1;
  • 64 ÷ 2 = 32 + 0;
  • 32 ÷ 2 = 16 + 0;
  • 16 ÷ 2 = 8 + 0;
  • 8 ÷ 2 = 4 + 0;
  • 4 ÷ 2 = 2 + 0;
  • 2 ÷ 2 = 1 + 0;
  • 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) =

1039(10) =

100 0000 1111(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, by removing the excess bits, from the right (if any of the excess bits is set on 1, we are losing precision...).


Mantissa (normalized) =

1. 0011 1111 1100 1101 1001 1010 0100 1001 1000 0110 0001 1010 1111 1 1111 1111 1111 1111 =

0011 1111 1100 1101 1001 1010 0100 1001 1000 0110 0001 1010 1111


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) =
100 0000 1111

Mantissa (52 bits) =
0011 1111 1100 1101 1001 1010 0100 1001 1000 0110 0001 1010 1111


Decimal number -81 869.602 684 384 910 389 780 66 converted to 64 bit double precision IEEE 754 binary floating point representation:

1 - 100 0000 1111 - 0011 1111 1100 1101 1001 1010 0100 1001 1000 0110 0001 1010 1111

» Convert decimal -81 869.602 684 384 910 389 781 16 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 10, 2026 [October]: Decimal Numbers Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard. Calculations performed during the month of: October - by our visitors

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