How this calculator works
An exponent (or power) tells you how many copies of a base to multiply. In the expression a^n, a is the base and n is the exponent. For a positive whole exponent, a^n is literally repeated multiplication: 2^10 = 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 = 1,024.
A negative exponent is the reciprocal: a^(−n) = 1 / a^n. 2^(−3) = 1 / 2^3 = 1 / 8 = 0.125. The sign of the exponent flips multiplication into division; the base itself does not change sign.
A fractional exponent is a root. a^(1/n) is the n-th root of a: 9^(1/2) = √9 = 3; 8^(1/3) = ∛8 = 2. A general fractional exponent a^(m/n) is the n-th root of a^m, or equivalently (a^(1/n))^m.
Any non-zero base to the power 0 is 1: 7^0 = 1, (−3)^0 = 1. The expression 0^0 is a special case — defined as 1 in combinatorics and algebra (so that polynomial formulas work at x = 0), left undefined in analysis.
The laws of exponents come from these definitions. Multiplying same bases: a^m × a^n = a^(m+n). Dividing: a^m / a^n = a^(m−n). Raising a power to a power: (a^m)^n = a^(m·n). Power of a product: (a·b)^n = a^n · b^n.
Very large or very small results overflow a decimal display, so the calculator switches to scientific notation. 2^100 ≈ 1.267 × 10^30; 2^(−100) ≈ 7.889 × 10⁻³¹. Use the scientific-notation calculator to read these if you need to convert back to a decimal.
Worked example
Three worked powers
- 2^10 = 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 = 1,024. In scientific form: 1.024 × 10³.
- 2^(−3) = 1 / (2 × 2 × 2) = 1 / 8 = 0.125.
- 8^(1/3) = ∛8 = 2 (because 2 × 2 × 2 = 8).
- 8^(2/3) = (8^(1/3))^2 = 2^2 = 4.
Common mistakes
- (a + b)^n is not a^n + b^n. (3 + 4)^2 = 49, not 9 + 16 = 25. There is no shortcut for a sum raised to a power apart from the binomial theorem.
- Treating a negative sign inside parentheses the same as outside. −3^2 is −9 (power applied first, then negate); (−3)^2 is 9 (negate first, then square).
- Dropping the parentheses on fractional exponents. 8^1/3 reads as "8 to the 1, divided by 3" in most calculators — not 8^(1/3). Always wrap the fraction.
Limitations of this calculator
- Returns real numbers only. For complex-valued results (even roots of negatives) use a complex-number calculator.
- Floating-point output rounds at about 15 significant figures. Exact integer powers above 2^53 lose precision.
- Does not simplify symbolic expressions (a^m × a^n → a^(m+n)); for that use a computer algebra system.
For your specific situation, consult a tax professional or financial advisor.
Questions people ask
What are the main exponent rules?
Four rules cover almost every case. Multiplication of same bases: a^m × a^n = a^(m+n). Division of same bases: a^m / a^n = a^(m−n). Power raised to a power: (a^m)^n = a^(m·n). Power of a product: (ab)^n = a^n · b^n. From these follow the special cases: a^(−n) = 1/a^n and a^0 = 1 (for a ≠ 0).
Why does a negative base with a fractional exponent go wrong?
It asks for an even root of a negative number, which has no real-number answer. (−4)^(1/2) is √−4, which exists only in the complex numbers (as 2i). The calculator reports "not a real number" when this happens. For odd roots a negative base is fine: (−8)^(1/3) = −2.
What is 0 to the power 0?
A long-running debate. In algebra, combinatorics and most of discrete mathematics, 0^0 is defined as 1 (so the binomial theorem and polynomial evaluations work at x = 0). In analysis the expression is often left as an indeterminate form because the limit depends on how 0 and 0 are approached. The calculator returns 1 for 0^0.
How do exponents relate to logarithms?
They are inverse operations. If 2^10 = 1,024, then log₂(1,024) = 10. Any statement about exponents has a mirror statement about logs. The log calculator computes the reverse direction.
Where are large exponents used in practice?
Scientific notation (chemistry, astronomy), bit-depth in computing (RGB colours use 2^8 values per channel), compound interest, radioactive decay, bacterial growth, and the time-complexity analysis of algorithms (O(2^n) is exponential-time).
Sources
Last reviewed October 2, 2026 · Last reviewed by Muhammad Ahmad on October 31, 2026