-1.055 013 854 056 596 755 958 8 Converted to 32 Bit Single Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal -1.055 013 854 056 596 755 958 8(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
-1.055 013 854 056 596 755 958 8(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:

|-1.055 013 854 056 596 755 958 8| = 1.055 013 854 056 596 755 958 8


2. First, convert to binary (in base 2) the integer part: 1.
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;
  • 1 ÷ 2 = 0 + 1;

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.

1(10) =

1(2)


4. Convert to binary (base 2) the fractional part: 0.055 013 854 056 596 755 958 8.

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.055 013 854 056 596 755 958 8 × 2 = 0 + 0.110 027 708 113 193 511 917 6;
  • 2) 0.110 027 708 113 193 511 917 6 × 2 = 0 + 0.220 055 416 226 387 023 835 2;
  • 3) 0.220 055 416 226 387 023 835 2 × 2 = 0 + 0.440 110 832 452 774 047 670 4;
  • 4) 0.440 110 832 452 774 047 670 4 × 2 = 0 + 0.880 221 664 905 548 095 340 8;
  • 5) 0.880 221 664 905 548 095 340 8 × 2 = 1 + 0.760 443 329 811 096 190 681 6;
  • 6) 0.760 443 329 811 096 190 681 6 × 2 = 1 + 0.520 886 659 622 192 381 363 2;
  • 7) 0.520 886 659 622 192 381 363 2 × 2 = 1 + 0.041 773 319 244 384 762 726 4;
  • 8) 0.041 773 319 244 384 762 726 4 × 2 = 0 + 0.083 546 638 488 769 525 452 8;
  • 9) 0.083 546 638 488 769 525 452 8 × 2 = 0 + 0.167 093 276 977 539 050 905 6;
  • 10) 0.167 093 276 977 539 050 905 6 × 2 = 0 + 0.334 186 553 955 078 101 811 2;
  • 11) 0.334 186 553 955 078 101 811 2 × 2 = 0 + 0.668 373 107 910 156 203 622 4;
  • 12) 0.668 373 107 910 156 203 622 4 × 2 = 1 + 0.336 746 215 820 312 407 244 8;
  • 13) 0.336 746 215 820 312 407 244 8 × 2 = 0 + 0.673 492 431 640 624 814 489 6;
  • 14) 0.673 492 431 640 624 814 489 6 × 2 = 1 + 0.346 984 863 281 249 628 979 2;
  • 15) 0.346 984 863 281 249 628 979 2 × 2 = 0 + 0.693 969 726 562 499 257 958 4;
  • 16) 0.693 969 726 562 499 257 958 4 × 2 = 1 + 0.387 939 453 124 998 515 916 8;
  • 17) 0.387 939 453 124 998 515 916 8 × 2 = 0 + 0.775 878 906 249 997 031 833 6;
  • 18) 0.775 878 906 249 997 031 833 6 × 2 = 1 + 0.551 757 812 499 994 063 667 2;
  • 19) 0.551 757 812 499 994 063 667 2 × 2 = 1 + 0.103 515 624 999 988 127 334 4;
  • 20) 0.103 515 624 999 988 127 334 4 × 2 = 0 + 0.207 031 249 999 976 254 668 8;
  • 21) 0.207 031 249 999 976 254 668 8 × 2 = 0 + 0.414 062 499 999 952 509 337 6;
  • 22) 0.414 062 499 999 952 509 337 6 × 2 = 0 + 0.828 124 999 999 905 018 675 2;
  • 23) 0.828 124 999 999 905 018 675 2 × 2 = 1 + 0.656 249 999 999 810 037 350 4;
  • 24) 0.656 249 999 999 810 037 350 4 × 2 = 1 + 0.312 499 999 999 620 074 700 8;

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.055 013 854 056 596 755 958 8(10) =

0.0000 1110 0001 0101 0110 0011(2)

6. Positive number before normalization:

1.055 013 854 056 596 755 958 8(10) =

1.0000 1110 0001 0101 0110 0011(2)

7. Normalize the binary representation of the number.

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


1.055 013 854 056 596 755 958 8(10) =

1.0000 1110 0001 0101 0110 0011(2) =

1.0000 1110 0001 0101 0110 0011(2) × 20


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

Mantissa (not normalized):
1.0000 1110 0001 0101 0110 0011


9. Adjust the exponent.

Use the 8 bit excess/bias notation:


Exponent (adjusted) =

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

0 + 2(8-1) - 1 =

(0 + 127)(10) =

127(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;
  • 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;

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

127(10) =

0111 1111(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, 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. 000 0111 0000 1010 1011 0001 1 =

000 0111 0000 1010 1011 0001


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

Mantissa (23 bits) =
000 0111 0000 1010 1011 0001


Decimal number -1.055 013 854 056 596 755 958 8 converted to 32 bit single precision IEEE 754 binary floating point representation:

1 - 0111 1111 - 000 0111 0000 1010 1011 0001

Share

» Convert decimal -1.055 013 854 056 596 755 965 3 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 09, 2026 [September]: Decimal Numbers Converted to 32 Bit Single Precision IEEE 754 Binary Floating Point Representation Standard. Calculations performed during the month of: September - by our visitors

» Improve your social skills: The Attention Economy - The Battlefield For Your Focus. Gemini Notebook YouTube Video of 7.50 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