Convert 0.009 597 501 612 to 32 Bit Single Precision IEEE 754 Binary Floating Point Standard, From a Base 10 Decimal Number

0.009 597 501 612(10) to 32 bit single precision IEEE 754 binary floating point (1 bit for sign, 8 bits for exponent, 23 bits for mantissa) = ?

1. First, convert to the binary (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 the binary (base 2) the fractional part: 0.009 597 501 612.

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.009 597 501 612 × 2 = 0 + 0.019 195 003 224;
  • 2) 0.019 195 003 224 × 2 = 0 + 0.038 390 006 448;
  • 3) 0.038 390 006 448 × 2 = 0 + 0.076 780 012 896;
  • 4) 0.076 780 012 896 × 2 = 0 + 0.153 560 025 792;
  • 5) 0.153 560 025 792 × 2 = 0 + 0.307 120 051 584;
  • 6) 0.307 120 051 584 × 2 = 0 + 0.614 240 103 168;
  • 7) 0.614 240 103 168 × 2 = 1 + 0.228 480 206 336;
  • 8) 0.228 480 206 336 × 2 = 0 + 0.456 960 412 672;
  • 9) 0.456 960 412 672 × 2 = 0 + 0.913 920 825 344;
  • 10) 0.913 920 825 344 × 2 = 1 + 0.827 841 650 688;
  • 11) 0.827 841 650 688 × 2 = 1 + 0.655 683 301 376;
  • 12) 0.655 683 301 376 × 2 = 1 + 0.311 366 602 752;
  • 13) 0.311 366 602 752 × 2 = 0 + 0.622 733 205 504;
  • 14) 0.622 733 205 504 × 2 = 1 + 0.245 466 411 008;
  • 15) 0.245 466 411 008 × 2 = 0 + 0.490 932 822 016;
  • 16) 0.490 932 822 016 × 2 = 0 + 0.981 865 644 032;
  • 17) 0.981 865 644 032 × 2 = 1 + 0.963 731 288 064;
  • 18) 0.963 731 288 064 × 2 = 1 + 0.927 462 576 128;
  • 19) 0.927 462 576 128 × 2 = 1 + 0.854 925 152 256;
  • 20) 0.854 925 152 256 × 2 = 1 + 0.709 850 304 512;
  • 21) 0.709 850 304 512 × 2 = 1 + 0.419 700 609 024;
  • 22) 0.419 700 609 024 × 2 = 0 + 0.839 401 218 048;
  • 23) 0.839 401 218 048 × 2 = 1 + 0.678 802 436 096;
  • 24) 0.678 802 436 096 × 2 = 1 + 0.357 604 872 192;
  • 25) 0.357 604 872 192 × 2 = 0 + 0.715 209 744 384;
  • 26) 0.715 209 744 384 × 2 = 1 + 0.430 419 488 768;
  • 27) 0.430 419 488 768 × 2 = 0 + 0.860 838 977 536;
  • 28) 0.860 838 977 536 × 2 = 1 + 0.721 677 955 072;
  • 29) 0.721 677 955 072 × 2 = 1 + 0.443 355 910 144;
  • 30) 0.443 355 910 144 × 2 = 0 + 0.886 711 820 288;

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.009 597 501 612(10) =


0.0000 0010 0111 0100 1111 1011 0101 10(2)


5. Positive number before normalization:

0.009 597 501 612(10) =


0.0000 0010 0111 0100 1111 1011 0101 10(2)


6. Normalize the binary representation of the number.

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

0.009 597 501 612(10) =


0.0000 0010 0111 0100 1111 1011 0101 10(2) =


0.0000 0010 0111 0100 1111 1011 0101 10(2) × 20 =


1.0011 1010 0111 1101 1010 110(2) × 2-7


7. Up to this moment, there are the following elements that would feed into the 32 bit single precision IEEE 754 binary floating point representation:

Sign: 0 (a positive number)


Exponent (unadjusted): -7


Mantissa (not normalized):
1.0011 1010 0111 1101 1010 110


8. Adjust the exponent.

Use the 8 bit excess/bias notation:

Exponent (adjusted) =


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


-7 + 2(8-1) - 1 =


(-7 + 127)(10) =


120(10)


9. Convert the adjusted exponent from the decimal (base 10) to 8 bit binary.

Use the same technique of repeatedly dividing by 2:

  • division = quotient + remainder;
  • 120 ÷ 2 = 60 + 0;
  • 60 ÷ 2 = 30 + 0;
  • 30 ÷ 2 = 15 + 0;
  • 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) =


120(10) =


0111 1000(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 23 bits, only if necessary (not the case here).

Mantissa (normalized) =


1. 001 1101 0011 1110 1101 0110 =


001 1101 0011 1110 1101 0110


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

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


Exponent (8 bits) =
0111 1000


Mantissa (23 bits) =
001 1101 0011 1110 1101 0110


Number 0.009 597 501 612 converted from decimal system (base 10) to 32 bit single precision IEEE 754 binary floating point:
0 - 0111 1000 - 001 1101 0011 1110 1101 0110

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

    • 0

      31
  • Exponent (8 bits):

    • 0

      30
    • 1

      29
    • 1

      28
    • 1

      27
    • 1

      26
    • 0

      25
    • 0

      24
    • 0

      23
  • Mantissa (23 bits):

    • 0

      22
    • 0

      21
    • 1

      20
    • 1

      19
    • 1

      18
    • 0

      17
    • 1

      16
    • 0

      15
    • 0

      14
    • 1

      13
    • 1

      12
    • 1

      11
    • 1

      10
    • 1

      9
    • 0

      8
    • 1

      7
    • 1

      6
    • 0

      5
    • 1

      4
    • 0

      3
    • 1

      2
    • 1

      1
    • 0

      0

More operations of this kind:

0.009 597 501 611 = ? ... 0.009 597 501 613 = ?


Convert to 32 bit single precision IEEE 754 binary floating point standard

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

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

0.009 597 501 612 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:58 UTC (GMT)
995 280 904 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:58 UTC (GMT)
0.300 788 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:58 UTC (GMT)
1 014 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:58 UTC (GMT)
458 758 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:58 UTC (GMT)
394.375 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:58 UTC (GMT)
0.001 21 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:58 UTC (GMT)
-2 104 387.78 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:57 UTC (GMT)
0.099 999 991 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:57 UTC (GMT)
-0.327 507 05 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:57 UTC (GMT)
-0.666 666 666 666 66 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:57 UTC (GMT)
1 111 101 011 110 011 011 111 111 101 022 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:57 UTC (GMT)
1 010 110.7 to 32 bit single precision IEEE 754 binary floating point = ? Nov 30 09:57 UTC (GMT)
All base ten decimal numbers converted to 32 bit single precision IEEE 754 binary floating point

How to convert decimal numbers from base ten to 32 bit single precision IEEE 754 binary floating point standard

Follow the steps below to convert a base 10 decimal number to 32 bit single 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 base ten 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 of the previous dividing 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 previous multiplying operations, starting from the top of the constructed list 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, by shifting the decimal point (or if you prefer, the decimal mark) "n" positions either to the left or to the right, so that only one non zero digit remains to the left of the decimal point.
  • 7. Adjust the exponent in 8 bit excess/bias notation and then convert it from decimal (base 10) to 8 bit binary, by using the same technique of repeatedly dividing by 2, as shown above:
    Exponent (adjusted) = Exponent (unadjusted) + 2(8-1) - 1
  • 8. Normalize mantissa, remove the leading (leftmost) bit, since it's allways '1' (and the decimal sign if the case) and adjust its length to 23 bits, either by removing the excess bits from the right (losing precision...) or by adding extra '0' bits 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 -25.347 from decimal system (base ten) to 32 bit single precision IEEE 754 binary floating point:

  • 1. Start with the positive version of the number:

    |-25.347| = 25.347

  • 2. First convert the integer part, 25. Divide it repeatedly by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
    • division = quotient + remainder;
    • 25 ÷ 2 = 12 + 1;
    • 12 ÷ 2 = 6 + 0;
    • 6 ÷ 2 = 3 + 0;
    • 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:

    25(10) = 1 1001(2)

  • 4. Then convert the fractional part, 0.347. 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.347 × 2 = 0 + 0.694;
    • 2) 0.694 × 2 = 1 + 0.388;
    • 3) 0.388 × 2 = 0 + 0.776;
    • 4) 0.776 × 2 = 1 + 0.552;
    • 5) 0.552 × 2 = 1 + 0.104;
    • 6) 0.104 × 2 = 0 + 0.208;
    • 7) 0.208 × 2 = 0 + 0.416;
    • 8) 0.416 × 2 = 0 + 0.832;
    • 9) 0.832 × 2 = 1 + 0.664;
    • 10) 0.664 × 2 = 1 + 0.328;
    • 11) 0.328 × 2 = 0 + 0.656;
    • 12) 0.656 × 2 = 1 + 0.312;
    • 13) 0.312 × 2 = 0 + 0.624;
    • 14) 0.624 × 2 = 1 + 0.248;
    • 15) 0.248 × 2 = 0 + 0.496;
    • 16) 0.496 × 2 = 0 + 0.992;
    • 17) 0.992 × 2 = 1 + 0.984;
    • 18) 0.984 × 2 = 1 + 0.968;
    • 19) 0.968 × 2 = 1 + 0.936;
    • 20) 0.936 × 2 = 1 + 0.872;
    • 21) 0.872 × 2 = 1 + 0.744;
    • 22) 0.744 × 2 = 1 + 0.488;
    • 23) 0.488 × 2 = 0 + 0.976;
    • 24) 0.976 × 2 = 1 + 0.952;
    • We didn't get any fractional part that was equal to zero. But we had enough iterations (over Mantissa limit = 23) 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.347(10) = 0.0101 1000 1101 0100 1111 1101(2)

  • 6. Summarizing - the positive number before normalization:

    25.347(10) = 1 1001.0101 1000 1101 0100 1111 1101(2)

  • 7. Normalize the binary representation of the number, shifting the decimal point 4 positions to the left so that only one non-zero digit stays to the left of the decimal point:

    25.347(10) =
    1 1001.0101 1000 1101 0100 1111 1101(2) =
    1 1001.0101 1000 1101 0100 1111 1101(2) × 20 =
    1.1001 0101 1000 1101 0100 1111 1101(2) × 24

  • 8. Up to this moment, there are the following elements that would feed into the 32 bit single precision IEEE 754 binary floating point:

    Sign: 1 (a negative number)

    Exponent (unadjusted): 4

    Mantissa (not-normalized): 1.1001 0101 1000 1101 0100 1111 1101

  • 9. Adjust the exponent in 8 bit excess/bias notation and then convert it from decimal (base 10) to 8 bit binary (base 2), by using the same technique of repeatedly dividing it by 2, as already demonstrated above:

    Exponent (adjusted) = Exponent (unadjusted) + 2(8-1) - 1 = (4 + 127)(10) = 131(10) =
    1000 0011(2)

  • 10. Normalize the mantissa, remove the leading (leftmost) bit, since it's allways '1' (and the decimal point) and adjust its length to 23 bits, by removing the excess bits from the right (losing precision...):

    Mantissa (not-normalized): 1.1001 0101 1000 1101 0100 1111 1101

    Mantissa (normalized): 100 1010 1100 0110 1010 0111

  • Conclusion:

    Sign (1 bit) = 1 (a negative number)

    Exponent (8 bits) = 1000 0011

    Mantissa (23 bits) = 100 1010 1100 0110 1010 0111

  • Number -25.347, converted from the decimal system (base 10) to 32 bit single precision IEEE 754 binary floating point =


    1 - 1000 0011 - 100 1010 1100 0110 1010 0111