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

Convert decimal 0.000 000 000 050 402 961(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 402 961(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 402 961.

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 402 961 × 2 = 0 + 0.000 000 000 100 805 922;
  • 2) 0.000 000 000 100 805 922 × 2 = 0 + 0.000 000 000 201 611 844;
  • 3) 0.000 000 000 201 611 844 × 2 = 0 + 0.000 000 000 403 223 688;
  • 4) 0.000 000 000 403 223 688 × 2 = 0 + 0.000 000 000 806 447 376;
  • 5) 0.000 000 000 806 447 376 × 2 = 0 + 0.000 000 001 612 894 752;
  • 6) 0.000 000 001 612 894 752 × 2 = 0 + 0.000 000 003 225 789 504;
  • 7) 0.000 000 003 225 789 504 × 2 = 0 + 0.000 000 006 451 579 008;
  • 8) 0.000 000 006 451 579 008 × 2 = 0 + 0.000 000 012 903 158 016;
  • 9) 0.000 000 012 903 158 016 × 2 = 0 + 0.000 000 025 806 316 032;
  • 10) 0.000 000 025 806 316 032 × 2 = 0 + 0.000 000 051 612 632 064;
  • 11) 0.000 000 051 612 632 064 × 2 = 0 + 0.000 000 103 225 264 128;
  • 12) 0.000 000 103 225 264 128 × 2 = 0 + 0.000 000 206 450 528 256;
  • 13) 0.000 000 206 450 528 256 × 2 = 0 + 0.000 000 412 901 056 512;
  • 14) 0.000 000 412 901 056 512 × 2 = 0 + 0.000 000 825 802 113 024;
  • 15) 0.000 000 825 802 113 024 × 2 = 0 + 0.000 001 651 604 226 048;
  • 16) 0.000 001 651 604 226 048 × 2 = 0 + 0.000 003 303 208 452 096;
  • 17) 0.000 003 303 208 452 096 × 2 = 0 + 0.000 006 606 416 904 192;
  • 18) 0.000 006 606 416 904 192 × 2 = 0 + 0.000 013 212 833 808 384;
  • 19) 0.000 013 212 833 808 384 × 2 = 0 + 0.000 026 425 667 616 768;
  • 20) 0.000 026 425 667 616 768 × 2 = 0 + 0.000 052 851 335 233 536;
  • 21) 0.000 052 851 335 233 536 × 2 = 0 + 0.000 105 702 670 467 072;
  • 22) 0.000 105 702 670 467 072 × 2 = 0 + 0.000 211 405 340 934 144;
  • 23) 0.000 211 405 340 934 144 × 2 = 0 + 0.000 422 810 681 868 288;
  • 24) 0.000 422 810 681 868 288 × 2 = 0 + 0.000 845 621 363 736 576;
  • 25) 0.000 845 621 363 736 576 × 2 = 0 + 0.001 691 242 727 473 152;
  • 26) 0.001 691 242 727 473 152 × 2 = 0 + 0.003 382 485 454 946 304;
  • 27) 0.003 382 485 454 946 304 × 2 = 0 + 0.006 764 970 909 892 608;
  • 28) 0.006 764 970 909 892 608 × 2 = 0 + 0.013 529 941 819 785 216;
  • 29) 0.013 529 941 819 785 216 × 2 = 0 + 0.027 059 883 639 570 432;
  • 30) 0.027 059 883 639 570 432 × 2 = 0 + 0.054 119 767 279 140 864;
  • 31) 0.054 119 767 279 140 864 × 2 = 0 + 0.108 239 534 558 281 728;
  • 32) 0.108 239 534 558 281 728 × 2 = 0 + 0.216 479 069 116 563 456;
  • 33) 0.216 479 069 116 563 456 × 2 = 0 + 0.432 958 138 233 126 912;
  • 34) 0.432 958 138 233 126 912 × 2 = 0 + 0.865 916 276 466 253 824;
  • 35) 0.865 916 276 466 253 824 × 2 = 1 + 0.731 832 552 932 507 648;
  • 36) 0.731 832 552 932 507 648 × 2 = 1 + 0.463 665 105 865 015 296;
  • 37) 0.463 665 105 865 015 296 × 2 = 0 + 0.927 330 211 730 030 592;
  • 38) 0.927 330 211 730 030 592 × 2 = 1 + 0.854 660 423 460 061 184;
  • 39) 0.854 660 423 460 061 184 × 2 = 1 + 0.709 320 846 920 122 368;
  • 40) 0.709 320 846 920 122 368 × 2 = 1 + 0.418 641 693 840 244 736;
  • 41) 0.418 641 693 840 244 736 × 2 = 0 + 0.837 283 387 680 489 472;
  • 42) 0.837 283 387 680 489 472 × 2 = 1 + 0.674 566 775 360 978 944;
  • 43) 0.674 566 775 360 978 944 × 2 = 1 + 0.349 133 550 721 957 888;
  • 44) 0.349 133 550 721 957 888 × 2 = 0 + 0.698 267 101 443 915 776;
  • 45) 0.698 267 101 443 915 776 × 2 = 1 + 0.396 534 202 887 831 552;
  • 46) 0.396 534 202 887 831 552 × 2 = 0 + 0.793 068 405 775 663 104;
  • 47) 0.793 068 405 775 663 104 × 2 = 1 + 0.586 136 811 551 326 208;
  • 48) 0.586 136 811 551 326 208 × 2 = 1 + 0.172 273 623 102 652 416;
  • 49) 0.172 273 623 102 652 416 × 2 = 0 + 0.344 547 246 205 304 832;
  • 50) 0.344 547 246 205 304 832 × 2 = 0 + 0.689 094 492 410 609 664;
  • 51) 0.689 094 492 410 609 664 × 2 = 1 + 0.378 188 984 821 219 328;
  • 52) 0.378 188 984 821 219 328 × 2 = 0 + 0.756 377 969 642 438 656;
  • 53) 0.756 377 969 642 438 656 × 2 = 1 + 0.512 755 939 284 877 312;
  • 54) 0.512 755 939 284 877 312 × 2 = 1 + 0.025 511 878 569 754 624;
  • 55) 0.025 511 878 569 754 624 × 2 = 0 + 0.051 023 757 139 509 248;
  • 56) 0.051 023 757 139 509 248 × 2 = 0 + 0.102 047 514 279 018 496;
  • 57) 0.102 047 514 279 018 496 × 2 = 0 + 0.204 095 028 558 036 992;
  • 58) 0.204 095 028 558 036 992 × 2 = 0 + 0.408 190 057 116 073 984;

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

0.0000 0000 0000 0000 0000 0000 0000 0000 0011 0111 0110 1011 0010 1100 00(2)

5. Positive number before normalization:

0.000 000 000 050 402 961(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0011 0111 0110 1011 0010 1100 00(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 402 961(10) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0011 0111 0110 1011 0010 1100 00(2) =

0.0000 0000 0000 0000 0000 0000 0000 0000 0011 0111 0110 1011 0010 1100 00(2) × 20 =

1.1011 1011 0101 1001 0110 000(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 0110 000


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

101 1101 1010 1100 1011 0000


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 0000


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

0 - 0101 1100 - 101 1101 1010 1100 1011 0000

» Convert decimal 0.000 000 000 050 403 055 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