Convert 10 000.000 08 to 64 Bit Double Precision IEEE 754 Binary Floating Point Standard, From a Number in Base 10 Decimal System

10 000.000 08(10) to 64 bit double precision IEEE 754 binary floating point (1 bit for sign, 11 bits for exponent, 52 bits for mantissa) = ?

1. First, convert to the binary (base 2) the integer part: 10 000.
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;
  • 10 000 ÷ 2 = 5 000 + 0;
  • 5 000 ÷ 2 = 2 500 + 0;
  • 2 500 ÷ 2 = 1 250 + 0;
  • 1 250 ÷ 2 = 625 + 0;
  • 625 ÷ 2 = 312 + 1;
  • 312 ÷ 2 = 156 + 0;
  • 156 ÷ 2 = 78 + 0;
  • 78 ÷ 2 = 39 + 0;
  • 39 ÷ 2 = 19 + 1;
  • 19 ÷ 2 = 9 + 1;
  • 9 ÷ 2 = 4 + 1;
  • 4 ÷ 2 = 2 + 0;
  • 2 ÷ 2 = 1 + 0;
  • 1 ÷ 2 = 0 + 1;

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.

10 000(10) =


10 0111 0001 0000(2)


3. Convert to the binary (base 2) the fractional part: 0.000 08.

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 08 × 2 = 0 + 0.000 16;
  • 2) 0.000 16 × 2 = 0 + 0.000 32;
  • 3) 0.000 32 × 2 = 0 + 0.000 64;
  • 4) 0.000 64 × 2 = 0 + 0.001 28;
  • 5) 0.001 28 × 2 = 0 + 0.002 56;
  • 6) 0.002 56 × 2 = 0 + 0.005 12;
  • 7) 0.005 12 × 2 = 0 + 0.010 24;
  • 8) 0.010 24 × 2 = 0 + 0.020 48;
  • 9) 0.020 48 × 2 = 0 + 0.040 96;
  • 10) 0.040 96 × 2 = 0 + 0.081 92;
  • 11) 0.081 92 × 2 = 0 + 0.163 84;
  • 12) 0.163 84 × 2 = 0 + 0.327 68;
  • 13) 0.327 68 × 2 = 0 + 0.655 36;
  • 14) 0.655 36 × 2 = 1 + 0.310 72;
  • 15) 0.310 72 × 2 = 0 + 0.621 44;
  • 16) 0.621 44 × 2 = 1 + 0.242 88;
  • 17) 0.242 88 × 2 = 0 + 0.485 76;
  • 18) 0.485 76 × 2 = 0 + 0.971 52;
  • 19) 0.971 52 × 2 = 1 + 0.943 04;
  • 20) 0.943 04 × 2 = 1 + 0.886 08;
  • 21) 0.886 08 × 2 = 1 + 0.772 16;
  • 22) 0.772 16 × 2 = 1 + 0.544 32;
  • 23) 0.544 32 × 2 = 1 + 0.088 64;
  • 24) 0.088 64 × 2 = 0 + 0.177 28;
  • 25) 0.177 28 × 2 = 0 + 0.354 56;
  • 26) 0.354 56 × 2 = 0 + 0.709 12;
  • 27) 0.709 12 × 2 = 1 + 0.418 24;
  • 28) 0.418 24 × 2 = 0 + 0.836 48;
  • 29) 0.836 48 × 2 = 1 + 0.672 96;
  • 30) 0.672 96 × 2 = 1 + 0.345 92;
  • 31) 0.345 92 × 2 = 0 + 0.691 84;
  • 32) 0.691 84 × 2 = 1 + 0.383 68;
  • 33) 0.383 68 × 2 = 0 + 0.767 36;
  • 34) 0.767 36 × 2 = 1 + 0.534 72;
  • 35) 0.534 72 × 2 = 1 + 0.069 44;
  • 36) 0.069 44 × 2 = 0 + 0.138 88;
  • 37) 0.138 88 × 2 = 0 + 0.277 76;
  • 38) 0.277 76 × 2 = 0 + 0.555 52;
  • 39) 0.555 52 × 2 = 1 + 0.111 04;
  • 40) 0.111 04 × 2 = 0 + 0.222 08;
  • 41) 0.222 08 × 2 = 0 + 0.444 16;
  • 42) 0.444 16 × 2 = 0 + 0.888 32;
  • 43) 0.888 32 × 2 = 1 + 0.776 64;
  • 44) 0.776 64 × 2 = 1 + 0.553 28;
  • 45) 0.553 28 × 2 = 1 + 0.106 56;
  • 46) 0.106 56 × 2 = 0 + 0.213 12;
  • 47) 0.213 12 × 2 = 0 + 0.426 24;
  • 48) 0.426 24 × 2 = 0 + 0.852 48;
  • 49) 0.852 48 × 2 = 1 + 0.704 96;
  • 50) 0.704 96 × 2 = 1 + 0.409 92;
  • 51) 0.409 92 × 2 = 0 + 0.819 84;
  • 52) 0.819 84 × 2 = 1 + 0.639 68;
  • 53) 0.639 68 × 2 = 1 + 0.279 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...)


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.000 08(10) =


0.0000 0000 0000 0101 0011 1110 0010 1101 0110 0010 0011 1000 1101 1(2)


5. Positive number before normalization:

10 000.000 08(10) =


10 0111 0001 0000.0000 0000 0000 0101 0011 1110 0010 1101 0110 0010 0011 1000 1101 1(2)


6. Normalize the binary representation of the number.

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

10 000.000 08(10) =


10 0111 0001 0000.0000 0000 0000 0101 0011 1110 0010 1101 0110 0010 0011 1000 1101 1(2) =


10 0111 0001 0000.0000 0000 0000 0101 0011 1110 0010 1101 0110 0010 0011 1000 1101 1(2) × 20 =


1.0011 1000 1000 0000 0000 0000 0010 1001 1111 0001 0110 1011 0001 0001 1100 0110 11(2) × 213


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


Mantissa (not normalized):
1.0011 1000 1000 0000 0000 0000 0010 1001 1111 0001 0110 1011 0001 0001 1100 0110 11


8. Adjust the exponent.

Use the 11 bit excess/bias notation:

Exponent (adjusted) =


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


13 + 2(11-1) - 1 =


(13 + 1 023)(10) =


1 036(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 036 ÷ 2 = 518 + 0;
  • 518 ÷ 2 = 259 + 0;
  • 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;

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


1036(10) =


100 0000 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, 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 1000 1000 0000 0000 0000 0010 1001 1111 0001 0110 1011 0001 00 0111 0001 1011 =


0011 1000 1000 0000 0000 0000 0010 1001 1111 0001 0110 1011 0001


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


Mantissa (52 bits) =
0011 1000 1000 0000 0000 0000 0010 1001 1111 0001 0110 1011 0001


Number 10 000.000 08 converted from decimal system (base 10) to 64 bit double precision IEEE 754 binary floating point:
0 - 100 0000 1100 - 0011 1000 1000 0000 0000 0000 0010 1001 1111 0001 0110 1011 0001

(64 bits IEEE 754)
  • Sign (1 bit):

    • 0

      63
  • Exponent (11 bits):

    • 1

      62
    • 0

      61
    • 0

      60
    • 0

      59
    • 0

      58
    • 0

      57
    • 0

      56
    • 1

      55
    • 1

      54
    • 0

      53
    • 0

      52
  • Mantissa (52 bits):

    • 0

      51
    • 0

      50
    • 1

      49
    • 1

      48
    • 1

      47
    • 0

      46
    • 0

      45
    • 0

      44
    • 1

      43
    • 0

      42
    • 0

      41
    • 0

      40
    • 0

      39
    • 0

      38
    • 0

      37
    • 0

      36
    • 0

      35
    • 0

      34
    • 0

      33
    • 0

      32
    • 0

      31
    • 0

      30
    • 0

      29
    • 0

      28
    • 0

      27
    • 0

      26
    • 1

      25
    • 0

      24
    • 1

      23
    • 0

      22
    • 0

      21
    • 1

      20
    • 1

      19
    • 1

      18
    • 1

      17
    • 1

      16
    • 0

      15
    • 0

      14
    • 0

      13
    • 1

      12
    • 0

      11
    • 1

      10
    • 1

      9
    • 0

      8
    • 1

      7
    • 0

      6
    • 1

      5
    • 1

      4
    • 0

      3
    • 0

      2
    • 0

      1
    • 1

      0

More operations of this kind:

10 000.000 07 = ? ... 10 000.000 09 = ?


Convert to 64 bit double precision IEEE 754 binary floating point standard

A number in 64 bit double precision IEEE 754 binary floating point standard representation requires three building elements: sign (it takes one bit and it's either 0 for positive or 1 for negative numbers), exponent (11 bits), mantissa (52 bits)

Latest decimal numbers converted from base ten to 64 bit double precision IEEE 754 floating point binary standard representation

10 000.000 08 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:49 UTC (GMT)
-5.625 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:49 UTC (GMT)
0.785 398 163 458 219 169 011 004 073 672 148 207 311 201 868 187 462 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:49 UTC (GMT)
13.928 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:48 UTC (GMT)
18 010 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:48 UTC (GMT)
11 111 105 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:48 UTC (GMT)
83.624 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:48 UTC (GMT)
1 892 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:48 UTC (GMT)
1 119 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:48 UTC (GMT)
-55 255.9 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:48 UTC (GMT)
25.435 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:48 UTC (GMT)
-9.907 7 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:48 UTC (GMT)
-453 661 to 64 bit double precision IEEE 754 binary floating point = ? Apr 18 07:48 UTC (GMT)
All base ten decimal numbers converted to 64 bit double precision IEEE 754 binary floating point

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