✳tools.stBrowse tools
◈ Processed on your device
±

Modular exponentiation

Compute base^exponent modulo a positive modulus with exact integer arithmetic.

Free

Enter an integer base, a nonnegative exponent and a positive modulus. Repeated squaring reduces intermediate values modulo the modulus, so the full power never needs to be expanded.

◈ Local processingFree

How to use

  1. Enter your text, values, or image.
  2. Adjust the options and run the tool.
  3. Copy or download your result.

Worked example

Example input

Integer base: 2
Nonnegative exponent: 10
Positive integer modulus: 1000

Example result

24

Limitations and details

Base and modulus accept at most 200 digits, and the integer exponent is limited to 10⁹; negative exponents are unsupported.

Inputs and options

Integer base
Text
Nonnegative exponent
Number · Minimum: 0 · Maximum: 1000000000
Positive integer modulus
Text

Frequently asked questions

Is this tool free and private?

Yes. All 300 tools are free in this phase. Processing happens in your browser; your input and files are not sent to our servers.

Related tools