Exponent calculator
2 to the power of 10 is 1024. Enter any base and exponent, negative or fractional ones included, and get the exact power. Impossible cases, like a negative base under a fractional exponent, are flagged instead of returning nonsense. Free in your browser.
- Free
- Runs in your browser
- No sign-up
- Your data stays on your device
Run — free
Worked example
- Base
- 2
- Exponent
- 10
- Result
- 1,024
The exponent calculator raises a base to a given power and returns the exact result. Send any two finite numbers — a base and an exponent — and get back the power, computed deterministically with no rounding surprises. It accepts negative bases, negative exponents and fractional exponents, so 2^10, 1.5^-2 and 27^(1/3) are all one call away.
What an exponent actually computes
Raising a base to a power means multiplying the base by itself as many times as the exponent says: 2^10 is 2 multiplied by itself ten times, which is 1024. The exponent calculator generalizes that idea beyond whole numbers. A negative exponent inverts the base first, so 2^-3 equals 1 divided by 2^3, or 0.125.
A fractional exponent takes a root, so 27^(1/3) is the cube root of 27, which is 3.
Edge cases, validation and stable output
Two combinations deserve a note. A negative base with a fractional exponent — say (-8)^0.5 — has no real result, and an astronomically large power can overflow the floating-point range; both return a clear error instead of a silent NaN or Infinity leaking into your pipeline. On the success path the result is rounded to twelve decimal places, which is far beyond the precision any downstream calculation needs but guarantees the output is byte-identical on every machine the code runs on.
Zero behaves as mathematics says: 0^0 is 1, 0 to a positive power is 0, and 0 to a negative power is an error because it divides by zero.
Where it fits in a pipeline
Exponentiation hides inside more everyday work than its name suggests: compound interest and loan amortization, exponential growth and decay models, unit conversions between scales, scientific notation normalization, and scoring formulas that weight one factor much harder than another. Because there is no state, no randomness and no clock involved, you can cache the result against the input pair forever: 2^10 was 1024 yesterday and will be 1024 tomorrow, which makes the capability trivially idempotent and safe to retry after any network hiccup.
What you can do with it
Compound interest and growth
Compute (1 + r)^n to project an investment, a user base or a debt over n periods in one deterministic call.
Validate hand-computed figures
Re-check the powers in a financial report or engineering sheet against an independent, auditable source before publishing.
Roots and unit scaling
Use fractional exponents for square and cube roots, or to convert between squared and cubed units of area and volume.
FAQ
Which inputs are accepted?
Any two finite numbers: the base and the exponent. Negative and fractional values work, including roots like 27^(1/3).
Can the result overflow?
Yes, with extreme inputs. In that case — and for a negative base with a fractional exponent — you get a clear error instead of a NaN or Infinity.
Is the output deterministic?
Yes. The result is rounded to twelve decimal places, so the same inputs always produce byte-identical output on any machine.
What is 0 to the power of 0?
The result is 1, as mathematics defines it. Zero raised to a positive power gives 0, while zero raised to a negative power is rejected, because it would mean dividing by zero.
How do negative and fractional exponents work?
A negative exponent inverts the base first, so 2 to the power of −3 is 1 divided by 2 to the power of 3, or 0.125. A fractional exponent takes a root, so 27 to the power of 1/3 is 3.
Related tools
For developers — API access
Everything on this page is available programmatically. This section is for teams who want to wire it into their own systems; everyone else can just use the tool above.
API endpoint
Prefer to automate it? One authenticated POST creates the task; the result comes back by webhook or a signed link. The same capability also runs here on the web, by email and from Telegram — and soon from our app too.
Call it from your stack
curl -X POST https://api.kit.forhosting.com/math/exponent \
-H "Authorization: Bearer $KIT_KEY" \
-H "Content-Type: application/json" \
-d '{"base":2,"exponent":10}'const res = await fetch("https://api.kit.forhosting.com/math/exponent", {
method: "POST",
headers: {
"Authorization": `Bearer ${process.env.KIT_KEY}`,
"Content-Type": "application/json"
},
body: JSON.stringify({
"base": 2,
"exponent": 10
})
});
const { task_id } = await res.json();import os, requests
res = requests.post(
"https://api.kit.forhosting.com/math/exponent",
headers={"Authorization": f"Bearer {os.environ['KIT_KEY']}"},
json={
"base": 2,
"exponent": 10
},
)
task_id = res.json()["task_id"]<?php
$res = file_get_contents("https://api.kit.forhosting.com/math/exponent", false, stream_context_create([
"http" => [
"method" => "POST",
"header" => "Authorization: Bearer " . getenv("KIT_KEY") . "\r\nContent-Type: application/json",
"content" => '{"base":2,"exponent":10}',
],
]));
$task = json_decode($res, true);body := bytes.NewBufferString(`{"base":2,"exponent":10}`)
req, _ := http.NewRequest("POST", "https://api.kit.forhosting.com/math/exponent", body)
req.Header.Set("Authorization", "Bearer "+os.Getenv("KIT_KEY"))
req.Header.Set("Content-Type", "application/json")
res, _ := http.DefaultClient.Do(req)Example request
{
"base": 2,
"exponent": 10
}Example response
{
"task_id": "tsk_a1b2c3d4e5f6a1b2c3d4e5f6",
"type": "math.exponent",
"status": "queued",
"_links": {
"result": "/tasks/tsk_…/result"
}
}The API is asynchronous: the call returns a task_id immediately and the result arrives by webhook. Polling is capped at 1 req/s per task.
Pricing
Published price — no tokens, no invented credits. A failed task is never charged.
Errors
| HTTP | Code | Meaning |
|---|---|---|
401 | unauthorized | Missing or invalid API key. |
402 | insufficient_balance | Your balance doesn't cover the task price. |
404 | unknown_type | That task type doesn't exist. |
429 | rate_limited | Too many requests. Use the webhook instead of polling. |
Technical notes
The same code runs free in your browser on this page, so you only pay when you automate it through the API, at $0.002 per request.
What an exponent actually computes
Because the endpoint accepts any finite floating-point numbers for both fields, all of these cases go through the same call with no special flags. You send the base and the exponent, and the response echoes both inputs back next to the result so the record is self-describing: which base, which power, which answer. That shape makes the output safe to store in a log or a spreadsheet without any extra context, and it means a downstream step can re-verify the computation later without re-reading the request that produced it.
Edge cases, validation and stable output
Both inputs must be finite numbers, and the endpoint rejects anything else with an invalid_input error that is never billed: a missing field, a string that does not parse, NaN or Infinity.
Where it fits in a pipeline
A typical integration computes growth factors for a forecast at $0.002 per request, or validates hand-computed figures in a financial report before publishing them.
Technical questions
What does it cost?
$0.002 per request. It is also free to run in your browser on this page.
What happens with invalid input?
The request is rejected with an invalid_input error explaining which field failed, and it is never billed.