Raise a base to an exponent

The engine computes a ** b. If a < 0 and b is not an integer, the operation is refused (even roots of negatives would be complex). If a = 0 and b < 0, that is division by zero. Overflow to infinity is reported as out of range.

aᵇ = a × a × … × a    (b entier positif)

a^(1/2) = √a    (a ≥ 0)

Base and exponent are reals with the negative-base constraint. This is not a compound-interest calculator: (1+r)^n with a principal and optional deposits has its own page that starts from money and a rate.

Base (a)

The number being multiplied by itself (or inverted, or rooted). Zero is allowed for nonnegative exponents.

Exponent (b)

How many times, including fractions and negatives. Integer required when the base is negative.

Assumptions

• Real numbers only.
• 0⁰ is treated as the floating-point convention of the runtime (typically 1 in JavaScript); do not treat that as a theorem.

Limits

• No complex results.
• Large exponents overflow.
• Not an interest or APR engine.

1024 is 2 multiplied ten times. 0.04 is the reciprocal of 25. For money growing at a stated rate, the compound-interest page applies A = P(1+r/n)^{nt} with a compounding frequency.

• Reading aᵇ as a × b.

  2¹⁰ is 1024, not 20.

• Taking (−8)^{1/3} here and expecting −2.

  A non-integer exponent with a negative base is refused. Cube roots of negatives are not implemented on this page.

• Square rootEnter a number that is not negative. The tool returns the principal (nonnegative) square root. It is the inverse of squaring, not a cube root or an nth root.
• Compound interestGrow a single principal at a nominal annual rate with a chosen compounding frequency, including continuous compounding. The page also reports the effective annual rate. There are no recurring deposits on this form.
• FractionsTwo integer fractions and an operation. The engine uses a common denominator or cross-products, then reduces by the GCF so the answer is in lowest terms.
• GCF (GCD)Enter at least two integers. The result is the largest positive integer that divides all of them — the same GCF used to reduce a fraction or a ratio.
• LCMEnter at least two nonzero integers. The result is the smallest positive integer that is a multiple of each — useful for common denominators and repeating schedules.
• RatioTwo integers in, a reduced ratio out (8 : 12 becomes 2 : 3), plus the quotient A/B and each term’s weight in the sum of absolute values — not “A as a percent of B.”

Written by Rédaction HexaCalc (editorial team). Content last updated: August 25, 2026. No third-party medical or financial review is claimed.

This calculation uses a standard mathematical identity. See also the methodology.