0.142 857 145 Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal 0.142 857 145(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.142 857 145(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. 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;

2. 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)


3. Convert to binary (base 2) the fractional part: 0.142 857 145.

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.142 857 145 × 2 = 0 + 0.285 714 29;
  • 2) 0.285 714 29 × 2 = 0 + 0.571 428 58;
  • 3) 0.571 428 58 × 2 = 1 + 0.142 857 16;
  • 4) 0.142 857 16 × 2 = 0 + 0.285 714 32;
  • 5) 0.285 714 32 × 2 = 0 + 0.571 428 64;
  • 6) 0.571 428 64 × 2 = 1 + 0.142 857 28;
  • 7) 0.142 857 28 × 2 = 0 + 0.285 714 56;
  • 8) 0.285 714 56 × 2 = 0 + 0.571 429 12;
  • 9) 0.571 429 12 × 2 = 1 + 0.142 858 24;
  • 10) 0.142 858 24 × 2 = 0 + 0.285 716 48;
  • 11) 0.285 716 48 × 2 = 0 + 0.571 432 96;
  • 12) 0.571 432 96 × 2 = 1 + 0.142 865 92;
  • 13) 0.142 865 92 × 2 = 0 + 0.285 731 84;
  • 14) 0.285 731 84 × 2 = 0 + 0.571 463 68;
  • 15) 0.571 463 68 × 2 = 1 + 0.142 927 36;
  • 16) 0.142 927 36 × 2 = 0 + 0.285 854 72;
  • 17) 0.285 854 72 × 2 = 0 + 0.571 709 44;
  • 18) 0.571 709 44 × 2 = 1 + 0.143 418 88;
  • 19) 0.143 418 88 × 2 = 0 + 0.286 837 76;
  • 20) 0.286 837 76 × 2 = 0 + 0.573 675 52;
  • 21) 0.573 675 52 × 2 = 1 + 0.147 351 04;
  • 22) 0.147 351 04 × 2 = 0 + 0.294 702 08;
  • 23) 0.294 702 08 × 2 = 0 + 0.589 404 16;
  • 24) 0.589 404 16 × 2 = 1 + 0.178 808 32;
  • 25) 0.178 808 32 × 2 = 0 + 0.357 616 64;
  • 26) 0.357 616 64 × 2 = 0 + 0.715 233 28;
  • 27) 0.715 233 28 × 2 = 1 + 0.430 466 56;
  • 28) 0.430 466 56 × 2 = 0 + 0.860 933 12;
  • 29) 0.860 933 12 × 2 = 1 + 0.721 866 24;
  • 30) 0.721 866 24 × 2 = 1 + 0.443 732 48;
  • 31) 0.443 732 48 × 2 = 0 + 0.887 464 96;
  • 32) 0.887 464 96 × 2 = 1 + 0.774 929 92;
  • 33) 0.774 929 92 × 2 = 1 + 0.549 859 84;
  • 34) 0.549 859 84 × 2 = 1 + 0.099 719 68;
  • 35) 0.099 719 68 × 2 = 0 + 0.199 439 36;
  • 36) 0.199 439 36 × 2 = 0 + 0.398 878 72;
  • 37) 0.398 878 72 × 2 = 0 + 0.797 757 44;
  • 38) 0.797 757 44 × 2 = 1 + 0.595 514 88;
  • 39) 0.595 514 88 × 2 = 1 + 0.191 029 76;
  • 40) 0.191 029 76 × 2 = 0 + 0.382 059 52;
  • 41) 0.382 059 52 × 2 = 0 + 0.764 119 04;
  • 42) 0.764 119 04 × 2 = 1 + 0.528 238 08;
  • 43) 0.528 238 08 × 2 = 1 + 0.056 476 16;
  • 44) 0.056 476 16 × 2 = 0 + 0.112 952 32;
  • 45) 0.112 952 32 × 2 = 0 + 0.225 904 64;
  • 46) 0.225 904 64 × 2 = 0 + 0.451 809 28;
  • 47) 0.451 809 28 × 2 = 0 + 0.903 618 56;
  • 48) 0.903 618 56 × 2 = 1 + 0.807 237 12;
  • 49) 0.807 237 12 × 2 = 1 + 0.614 474 24;
  • 50) 0.614 474 24 × 2 = 1 + 0.228 948 48;
  • 51) 0.228 948 48 × 2 = 0 + 0.457 896 96;
  • 52) 0.457 896 96 × 2 = 0 + 0.915 793 92;
  • 53) 0.915 793 92 × 2 = 1 + 0.831 587 84;
  • 54) 0.831 587 84 × 2 = 1 + 0.663 175 68;
  • 55) 0.663 175 68 × 2 = 1 + 0.326 351 36;

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


4. 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.142 857 145(10) =

0.0010 0100 1001 0010 0100 1001 0010 1101 1100 0110 0110 0001 1100 111(2)

5. Positive number before normalization:

0.142 857 145(10) =

0.0010 0100 1001 0010 0100 1001 0010 1101 1100 0110 0110 0001 1100 111(2)

6. Normalize the binary representation of the number.

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


0.142 857 145(10) =

0.0010 0100 1001 0010 0100 1001 0010 1101 1100 0110 0110 0001 1100 111(2) =

0.0010 0100 1001 0010 0100 1001 0010 1101 1100 0110 0110 0001 1100 111(2) × 20 =

1.0010 0100 1001 0010 0100 1001 0110 1110 0011 0011 0000 1110 0111(2) × 2-3


7. 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 0 (a positive number)

Exponent (unadjusted): -3

Mantissa (not normalized):
1.0010 0100 1001 0010 0100 1001 0110 1110 0011 0011 0000 1110 0111


8. Adjust the exponent.

Use the 11 bit excess/bias notation:


Exponent (adjusted) =

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

-3 + 2(11-1) - 1 =

(-3 + 1 023)(10) =

1 020(10)


9. 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 020 ÷ 2 = 510 + 0;
  • 510 ÷ 2 = 255 + 0;
  • 255 ÷ 2 = 127 + 1;
  • 127 ÷ 2 = 63 + 1;
  • 63 ÷ 2 = 31 + 1;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 7 ÷ 2 = 3 + 1;
  • 3 ÷ 2 = 1 + 1;
  • 1 ÷ 2 = 0 + 1;

10. Construct the base 2 representation of the adjusted exponent.

Take all the remainders starting from the bottom of the list constructed above.


Exponent (adjusted) =

1020(10) =

011 1111 1100(2)


11. 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. 0010 0100 1001 0010 0100 1001 0110 1110 0011 0011 0000 1110 0111 =

0010 0100 1001 0010 0100 1001 0110 1110 0011 0011 0000 1110 0111


12. The three elements that make up the number's 64 bit double precision IEEE 754 binary floating point representation:

Sign (1 bit) =
0 (a positive number)

Exponent (11 bits) =
011 1111 1100

Mantissa (52 bits) =
0010 0100 1001 0010 0100 1001 0110 1110 0011 0011 0000 1110 0111


Decimal number 0.142 857 145 converted to 64 bit double precision IEEE 754 binary floating point representation:

0 - 011 1111 1100 - 0010 0100 1001 0010 0100 1001 0110 1110 0011 0011 0000 1110 0111

Share

» Convert decimal 0.142 857 197 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 07, 2026 [July]: Decimal Numbers Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard. Calculations performed during the month of: July - 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