-0.000 000 000 69 Converted to 32 Bit Single Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal -0.000 000 000 69(10) to 32 bit single precision IEEE 754 binary floating point representation standard (1 bit for sign, 8 bits for exponent, 23 bits for mantissa)

What are the steps to convert decimal number
-0.000 000 000 69(10) to 32 bit single precision IEEE 754 binary floating point representation (1 bit for sign, 8 bits for exponent, 23 bits for mantissa)

1. Start with the positive version of the number:

|-0.000 000 000 69| = 0.000 000 000 69


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

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 69 × 2 = 0 + 0.000 000 001 38;
  • 2) 0.000 000 001 38 × 2 = 0 + 0.000 000 002 76;
  • 3) 0.000 000 002 76 × 2 = 0 + 0.000 000 005 52;
  • 4) 0.000 000 005 52 × 2 = 0 + 0.000 000 011 04;
  • 5) 0.000 000 011 04 × 2 = 0 + 0.000 000 022 08;
  • 6) 0.000 000 022 08 × 2 = 0 + 0.000 000 044 16;
  • 7) 0.000 000 044 16 × 2 = 0 + 0.000 000 088 32;
  • 8) 0.000 000 088 32 × 2 = 0 + 0.000 000 176 64;
  • 9) 0.000 000 176 64 × 2 = 0 + 0.000 000 353 28;
  • 10) 0.000 000 353 28 × 2 = 0 + 0.000 000 706 56;
  • 11) 0.000 000 706 56 × 2 = 0 + 0.000 001 413 12;
  • 12) 0.000 001 413 12 × 2 = 0 + 0.000 002 826 24;
  • 13) 0.000 002 826 24 × 2 = 0 + 0.000 005 652 48;
  • 14) 0.000 005 652 48 × 2 = 0 + 0.000 011 304 96;
  • 15) 0.000 011 304 96 × 2 = 0 + 0.000 022 609 92;
  • 16) 0.000 022 609 92 × 2 = 0 + 0.000 045 219 84;
  • 17) 0.000 045 219 84 × 2 = 0 + 0.000 090 439 68;
  • 18) 0.000 090 439 68 × 2 = 0 + 0.000 180 879 36;
  • 19) 0.000 180 879 36 × 2 = 0 + 0.000 361 758 72;
  • 20) 0.000 361 758 72 × 2 = 0 + 0.000 723 517 44;
  • 21) 0.000 723 517 44 × 2 = 0 + 0.001 447 034 88;
  • 22) 0.001 447 034 88 × 2 = 0 + 0.002 894 069 76;
  • 23) 0.002 894 069 76 × 2 = 0 + 0.005 788 139 52;
  • 24) 0.005 788 139 52 × 2 = 0 + 0.011 576 279 04;
  • 25) 0.011 576 279 04 × 2 = 0 + 0.023 152 558 08;
  • 26) 0.023 152 558 08 × 2 = 0 + 0.046 305 116 16;
  • 27) 0.046 305 116 16 × 2 = 0 + 0.092 610 232 32;
  • 28) 0.092 610 232 32 × 2 = 0 + 0.185 220 464 64;
  • 29) 0.185 220 464 64 × 2 = 0 + 0.370 440 929 28;
  • 30) 0.370 440 929 28 × 2 = 0 + 0.740 881 858 56;
  • 31) 0.740 881 858 56 × 2 = 1 + 0.481 763 717 12;
  • 32) 0.481 763 717 12 × 2 = 0 + 0.963 527 434 24;
  • 33) 0.963 527 434 24 × 2 = 1 + 0.927 054 868 48;
  • 34) 0.927 054 868 48 × 2 = 1 + 0.854 109 736 96;
  • 35) 0.854 109 736 96 × 2 = 1 + 0.708 219 473 92;
  • 36) 0.708 219 473 92 × 2 = 1 + 0.416 438 947 84;
  • 37) 0.416 438 947 84 × 2 = 0 + 0.832 877 895 68;
  • 38) 0.832 877 895 68 × 2 = 1 + 0.665 755 791 36;
  • 39) 0.665 755 791 36 × 2 = 1 + 0.331 511 582 72;
  • 40) 0.331 511 582 72 × 2 = 0 + 0.663 023 165 44;
  • 41) 0.663 023 165 44 × 2 = 1 + 0.326 046 330 88;
  • 42) 0.326 046 330 88 × 2 = 0 + 0.652 092 661 76;
  • 43) 0.652 092 661 76 × 2 = 1 + 0.304 185 323 52;
  • 44) 0.304 185 323 52 × 2 = 0 + 0.608 370 647 04;
  • 45) 0.608 370 647 04 × 2 = 1 + 0.216 741 294 08;
  • 46) 0.216 741 294 08 × 2 = 0 + 0.433 482 588 16;
  • 47) 0.433 482 588 16 × 2 = 0 + 0.866 965 176 32;
  • 48) 0.866 965 176 32 × 2 = 1 + 0.733 930 352 64;
  • 49) 0.733 930 352 64 × 2 = 1 + 0.467 860 705 28;
  • 50) 0.467 860 705 28 × 2 = 0 + 0.935 721 410 56;
  • 51) 0.935 721 410 56 × 2 = 1 + 0.871 442 821 12;
  • 52) 0.871 442 821 12 × 2 = 1 + 0.742 885 642 24;
  • 53) 0.742 885 642 24 × 2 = 1 + 0.485 771 284 48;
  • 54) 0.485 771 284 48 × 2 = 0 + 0.971 542 568 96;

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

0.0000 0000 0000 0000 0000 0000 0000 0010 1111 0110 1010 1001 1011 10(2)

6. Positive number before normalization:

0.000 000 000 69(10) =

0.0000 0000 0000 0000 0000 0000 0000 0010 1111 0110 1010 1001 1011 10(2)

7. Normalize the binary representation of the number.

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


0.000 000 000 69(10) =

0.0000 0000 0000 0000 0000 0000 0000 0010 1111 0110 1010 1001 1011 10(2) =

0.0000 0000 0000 0000 0000 0000 0000 0010 1111 0110 1010 1001 1011 10(2) × 20 =

1.0111 1011 0101 0100 1101 110(2) × 2-31


8. 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 1 (a negative number)

Exponent (unadjusted): -31

Mantissa (not normalized):
1.0111 1011 0101 0100 1101 110


9. Adjust the exponent.

Use the 8 bit excess/bias notation:


Exponent (adjusted) =

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

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

(-31 + 127)(10) =

96(10)


10. 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;
  • 96 ÷ 2 = 48 + 0;
  • 48 ÷ 2 = 24 + 0;
  • 24 ÷ 2 = 12 + 0;
  • 12 ÷ 2 = 6 + 0;
  • 6 ÷ 2 = 3 + 0;
  • 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) =

96(10) =

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


Mantissa (normalized) =

1. 011 1101 1010 1010 0110 1110 =

011 1101 1010 1010 0110 1110


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

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

Exponent (8 bits) =
0110 0000

Mantissa (23 bits) =
011 1101 1010 1010 0110 1110


Decimal number -0.000 000 000 69 converted to 32 bit single precision IEEE 754 binary floating point representation:

1 - 0110 0000 - 011 1101 1010 1010 0110 1110

Share

» Convert decimal -0.000 000 000 7 to 32 bit single precision IEEE 754 binary floating point representation standard

» Calculations Performed by Our Visitors: Decimal Numbers Converted to 32 Bit Single Precision IEEE 754 Binary Floating Point Representation Standard. Data organized on a Monthly Basis

» Month 05, 2026 [May]: Decimal Numbers Converted to 32 Bit Single Precision IEEE 754 Binary Floating Point Representation Standard. Calculations performed during the month of: May - by our visitors

» Improve your social skills: The Art of Strategic Ambiguity and Concealed Intentions. NotebookLM YouTube Video of 6.59 minutes

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