Prime Factorization & Number Theory

The whole number to break into prime factors. You also get its divisor count, the sum of divisors and Euler’s totient φ(n).

Example: 360 factors as 2³ · 3² · 5.

Two or more whole numbers, separated by commas or spaces. The tool returns their greatest common divisor and least common multiple.

The base value the modular operation acts on — the number being reduced, inverted or raised to a power modulo m.

The exponent in aᵇ mod m. Thanks to fast modular exponentiation it can be very large — thousands of digits are no problem.

The modulus — results are given as remainders between 0 and m − 1. For the modular inverse, m must share no common factor with a.