0.000 000 000 050 403 011 Converted to 32 Bit Single Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal 0.000 000 000 050 403 011(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 050 403 011(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. 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;

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 binary (base 2) the fractional part: 0.000 000 000 050 403 011.

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 050 403 011 × 2 = 0 + 0.000 000 000 100 806 022;
  • 2) 0.000 000 000 100 806 022 × 2 = 0 + 0.000 000 000 201 612 044;
  • 3) 0.000 000 000 201 612 044 × 2 = 0 + 0.000 000 000 403 224 088;
  • 4) 0.000 000 000 403 224 088 × 2 = 0 + 0.000 000 000 806 448 176;
  • 5) 0.000 000 000 806 448 176 × 2 = 0 + 0.000 000 001 612 896 352;
  • 6) 0.000 000 001 612 896 352 × 2 = 0 + 0.000 000 003 225 792 704;
  • 7) 0.000 000 003 225 792 704 × 2 = 0 + 0.000 000 006 451 585 408;
  • 8) 0.000 000 006 451 585 408 × 2 = 0 + 0.000 000 012 903 170 816;
  • 9) 0.000 000 012 903 170 816 × 2 = 0 + 0.000 000 025 806 341 632;
  • 10) 0.000 000 025 806 341 632 × 2 = 0 + 0.000 000 051 612 683 264;
  • 11) 0.000 000 051 612 683 264 × 2 = 0 + 0.000 000 103 225 366 528;
  • 12) 0.000 000 103 225 366 528 × 2 = 0 + 0.000 000 206 450 733 056;
  • 13) 0.000 000 206 450 733 056 × 2 = 0 + 0.000 000 412 901 466 112;
  • 14) 0.000 000 412 901 466 112 × 2 = 0 + 0.000 000 825 802 932 224;
  • 15) 0.000 000 825 802 932 224 × 2 = 0 + 0.000 001 651 605 864 448;
  • 16) 0.000 001 651 605 864 448 × 2 = 0 + 0.000 003 303 211 728 896;
  • 17) 0.000 003 303 211 728 896 × 2 = 0 + 0.000 006 606 423 457 792;
  • 18) 0.000 006 606 423 457 792 × 2 = 0 + 0.000 013 212 846 915 584;
  • 19) 0.000 013 212 846 915 584 × 2 = 0 + 0.000 026 425 693 831 168;
  • 20) 0.000 026 425 693 831 168 × 2 = 0 + 0.000 052 851 387 662 336;
  • 21) 0.000 052 851 387 662 336 × 2 = 0 + 0.000 105 702 775 324 672;
  • 22) 0.000 105 702 775 324 672 × 2 = 0 + 0.000 211 405 550 649 344;
  • 23) 0.000 211 405 550 649 344 × 2 = 0 + 0.000 422 811 101 298 688;
  • 24) 0.000 422 811 101 298 688 × 2 = 0 + 0.000 845 622 202 597 376;
  • 25) 0.000 845 622 202 597 376 × 2 = 0 + 0.001 691 244 405 194 752;
  • 26) 0.001 691 244 405 194 752 × 2 = 0 + 0.003 382 488 810 389 504;
  • 27) 0.003 382 488 810 389 504 × 2 = 0 + 0.006 764 977 620 779 008;
  • 28) 0.006 764 977 620 779 008 × 2 = 0 + 0.013 529 955 241 558 016;
  • 29) 0.013 529 955 241 558 016 × 2 = 0 + 0.027 059 910 483 116 032;
  • 30) 0.027 059 910 483 116 032 × 2 = 0 + 0.054 119 820 966 232 064;
  • 31) 0.054 119 820 966 232 064 × 2 = 0 + 0.108 239 641 932 464 128;
  • 32) 0.108 239 641 932 464 128 × 2 = 0 + 0.216 479 283 864 928 256;
  • 33) 0.216 479 283 864 928 256 × 2 = 0 + 0.432 958 567 729 856 512;
  • 34) 0.432 958 567 729 856 512 × 2 = 0 + 0.865 917 135 459 713 024;
  • 35) 0.865 917 135 459 713 024 × 2 = 1 + 0.731 834 270 919 426 048;
  • 36) 0.731 834 270 919 426 048 × 2 = 1 + 0.463 668 541 838 852 096;
  • 37) 0.463 668 541 838 852 096 × 2 = 0 + 0.927 337 083 677 704 192;
  • 38) 0.927 337 083 677 704 192 × 2 = 1 + 0.854 674 167 355 408 384;
  • 39) 0.854 674 167 355 408 384 × 2 = 1 + 0.709 348 334 710 816 768;
  • 40) 0.709 348 334 710 816 768 × 2 = 1 + 0.418 696 669 421 633 536;
  • 41) 0.418 696 669 421 633 536 × 2 = 0 + 0.837 393 338 843 267 072;
  • 42) 0.837 393 338 843 267 072 × 2 = 1 + 0.674 786 677 686 534 144;
  • 43) 0.674 786 677 686 534 144 × 2 = 1 + 0.349 573 355 373 068 288;
  • 44) 0.349 573 355 373 068 288 × 2 = 0 + 0.699 146 710 746 136 576;
  • 45) 0.699 146 710 746 136 576 × 2 = 1 + 0.398 293 421 492 273 152;
  • 46) 0.398 293 421 492 273 152 × 2 = 0 + 0.796 586 842 984 546 304;
  • 47) 0.796 586 842 984 546 304 × 2 = 1 + 0.593 173 685 969 092 608;
  • 48) 0.593 173 685 969 092 608 × 2 = 1 + 0.186 347 371 938 185 216;
  • 49) 0.186 347 371 938 185 216 × 2 = 0 + 0.372 694 743 876 370 432;
  • 50) 0.372 694 743 876 370 432 × 2 = 0 + 0.745 389 487 752 740 864;
  • 51) 0.745 389 487 752 740 864 × 2 = 1 + 0.490 778 975 505 481 728;
  • 52) 0.490 778 975 505 481 728 × 2 = 0 + 0.981 557 951 010 963 456;
  • 53) 0.981 557 951 010 963 456 × 2 = 1 + 0.963 115 902 021 926 912;
  • 54) 0.963 115 902 021 926 912 × 2 = 1 + 0.926 231 804 043 853 824;
  • 55) 0.926 231 804 043 853 824 × 2 = 1 + 0.852 463 608 087 707 648;
  • 56) 0.852 463 608 087 707 648 × 2 = 1 + 0.704 927 216 175 415 296;
  • 57) 0.704 927 216 175 415 296 × 2 = 1 + 0.409 854 432 350 830 592;
  • 58) 0.409 854 432 350 830 592 × 2 = 0 + 0.819 708 864 701 661 184;

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


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 000 000 050 403 011(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0011 0111 0110 1011 0010 1111 10(2)

5. Positive number before normalization:

0.000 000 000 050 403 011(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0011 0111 0110 1011 0010 1111 10(2)

6. Normalize the binary representation of the number.

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


0.000 000 000 050 403 011(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0011 0111 0110 1011 0010 1111 10(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0011 0111 0110 1011 0010 1111 10(2) × 20 =

1.1011 1011 0101 1001 0111 110(2) × 2-35


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

Mantissa (not normalized):
1.1011 1011 0101 1001 0111 110


8. Adjust the exponent.

Use the 8 bit excess/bias notation:


Exponent (adjusted) =

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

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

(-35 + 127)(10) =

92(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;
  • 92 ÷ 2 = 46 + 0;
  • 46 ÷ 2 = 23 + 0;
  • 23 ÷ 2 = 11 + 1;
  • 11 ÷ 2 = 5 + 1;
  • 5 ÷ 2 = 2 + 1;
  • 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) =

92(10) =

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


Mantissa (normalized) =

1. 101 1101 1010 1100 1011 1110 =

101 1101 1010 1100 1011 1110


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

Mantissa (23 bits) =
101 1101 1010 1100 1011 1110


Decimal number 0.000 000 000 050 403 011 converted to 32 bit single precision IEEE 754 binary floating point representation:

0 - 0101 1100 - 101 1101 1010 1100 1011 1110

» Convert decimal 0.000 000 000 050 403 012 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 10, 2026 [October]: Decimal Numbers Converted to 32 Bit Single Precision IEEE 754 Binary Floating Point Representation Standard. Calculations performed during the month of: October - by our visitors

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