-0.000 012 668 315 321 212 17 Converted to 32 Bit Single Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal -0.000 012 668 315 321 212 17(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 012 668 315 321 212 17(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 012 668 315 321 212 17| = 0.000 012 668 315 321 212 17


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 012 668 315 321 212 17.

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 012 668 315 321 212 17 × 2 = 0 + 0.000 025 336 630 642 424 34;
  • 2) 0.000 025 336 630 642 424 34 × 2 = 0 + 0.000 050 673 261 284 848 68;
  • 3) 0.000 050 673 261 284 848 68 × 2 = 0 + 0.000 101 346 522 569 697 36;
  • 4) 0.000 101 346 522 569 697 36 × 2 = 0 + 0.000 202 693 045 139 394 72;
  • 5) 0.000 202 693 045 139 394 72 × 2 = 0 + 0.000 405 386 090 278 789 44;
  • 6) 0.000 405 386 090 278 789 44 × 2 = 0 + 0.000 810 772 180 557 578 88;
  • 7) 0.000 810 772 180 557 578 88 × 2 = 0 + 0.001 621 544 361 115 157 76;
  • 8) 0.001 621 544 361 115 157 76 × 2 = 0 + 0.003 243 088 722 230 315 52;
  • 9) 0.003 243 088 722 230 315 52 × 2 = 0 + 0.006 486 177 444 460 631 04;
  • 10) 0.006 486 177 444 460 631 04 × 2 = 0 + 0.012 972 354 888 921 262 08;
  • 11) 0.012 972 354 888 921 262 08 × 2 = 0 + 0.025 944 709 777 842 524 16;
  • 12) 0.025 944 709 777 842 524 16 × 2 = 0 + 0.051 889 419 555 685 048 32;
  • 13) 0.051 889 419 555 685 048 32 × 2 = 0 + 0.103 778 839 111 370 096 64;
  • 14) 0.103 778 839 111 370 096 64 × 2 = 0 + 0.207 557 678 222 740 193 28;
  • 15) 0.207 557 678 222 740 193 28 × 2 = 0 + 0.415 115 356 445 480 386 56;
  • 16) 0.415 115 356 445 480 386 56 × 2 = 0 + 0.830 230 712 890 960 773 12;
  • 17) 0.830 230 712 890 960 773 12 × 2 = 1 + 0.660 461 425 781 921 546 24;
  • 18) 0.660 461 425 781 921 546 24 × 2 = 1 + 0.320 922 851 563 843 092 48;
  • 19) 0.320 922 851 563 843 092 48 × 2 = 0 + 0.641 845 703 127 686 184 96;
  • 20) 0.641 845 703 127 686 184 96 × 2 = 1 + 0.283 691 406 255 372 369 92;
  • 21) 0.283 691 406 255 372 369 92 × 2 = 0 + 0.567 382 812 510 744 739 84;
  • 22) 0.567 382 812 510 744 739 84 × 2 = 1 + 0.134 765 625 021 489 479 68;
  • 23) 0.134 765 625 021 489 479 68 × 2 = 0 + 0.269 531 250 042 978 959 36;
  • 24) 0.269 531 250 042 978 959 36 × 2 = 0 + 0.539 062 500 085 957 918 72;
  • 25) 0.539 062 500 085 957 918 72 × 2 = 1 + 0.078 125 000 171 915 837 44;
  • 26) 0.078 125 000 171 915 837 44 × 2 = 0 + 0.156 250 000 343 831 674 88;
  • 27) 0.156 250 000 343 831 674 88 × 2 = 0 + 0.312 500 000 687 663 349 76;
  • 28) 0.312 500 000 687 663 349 76 × 2 = 0 + 0.625 000 001 375 326 699 52;
  • 29) 0.625 000 001 375 326 699 52 × 2 = 1 + 0.250 000 002 750 653 399 04;
  • 30) 0.250 000 002 750 653 399 04 × 2 = 0 + 0.500 000 005 501 306 798 08;
  • 31) 0.500 000 005 501 306 798 08 × 2 = 1 + 0.000 000 011 002 613 596 16;
  • 32) 0.000 000 011 002 613 596 16 × 2 = 0 + 0.000 000 022 005 227 192 32;
  • 33) 0.000 000 022 005 227 192 32 × 2 = 0 + 0.000 000 044 010 454 384 64;
  • 34) 0.000 000 044 010 454 384 64 × 2 = 0 + 0.000 000 088 020 908 769 28;
  • 35) 0.000 000 088 020 908 769 28 × 2 = 0 + 0.000 000 176 041 817 538 56;
  • 36) 0.000 000 176 041 817 538 56 × 2 = 0 + 0.000 000 352 083 635 077 12;
  • 37) 0.000 000 352 083 635 077 12 × 2 = 0 + 0.000 000 704 167 270 154 24;
  • 38) 0.000 000 704 167 270 154 24 × 2 = 0 + 0.000 001 408 334 540 308 48;
  • 39) 0.000 001 408 334 540 308 48 × 2 = 0 + 0.000 002 816 669 080 616 96;
  • 40) 0.000 002 816 669 080 616 96 × 2 = 0 + 0.000 005 633 338 161 233 92;

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 012 668 315 321 212 17(10) =

0.0000 0000 0000 0000 1101 0100 1000 1010 0000 0000(2)

6. Positive number before normalization:

0.000 012 668 315 321 212 17(10) =

0.0000 0000 0000 0000 1101 0100 1000 1010 0000 0000(2)

7. Normalize the binary representation of the number.

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


0.000 012 668 315 321 212 17(10) =

0.0000 0000 0000 0000 1101 0100 1000 1010 0000 0000(2) =

0.0000 0000 0000 0000 1101 0100 1000 1010 0000 0000(2) × 20 =

1.1010 1001 0001 0100 0000 000(2) × 2-17


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

Mantissa (not normalized):
1.1010 1001 0001 0100 0000 000


9. Adjust the exponent.

Use the 8 bit excess/bias notation:


Exponent (adjusted) =

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

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

(-17 + 127)(10) =

110(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;
  • 110 ÷ 2 = 55 + 0;
  • 55 ÷ 2 = 27 + 1;
  • 27 ÷ 2 = 13 + 1;
  • 13 ÷ 2 = 6 + 1;
  • 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) =

110(10) =

0110 1110(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. 101 0100 1000 1010 0000 0000 =

101 0100 1000 1010 0000 0000


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 1110

Mantissa (23 bits) =
101 0100 1000 1010 0000 0000


Decimal number -0.000 012 668 315 321 212 17 converted to 32 bit single precision IEEE 754 binary floating point representation:

1 - 0110 1110 - 101 0100 1000 1010 0000 0000

Share

» Convert decimal -0.000 012 668 315 321 211 19 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 07, 2026 [July]: Decimal Numbers Converted to 32 Bit Single Precision IEEE 754 Binary Floating Point Representation Standard. Calculations performed during the month of: July - by our visitors

» Improve your social skills: The Hidden Requirement in Every Single Job Description. NotebookLM YouTube Video of 8.15 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