Euler's Totient φ(n)
Count integers coprime to n
About this calculator
Euler's Totient calculator computes φ(n), the count of integers from 1 to n that are coprime to n. See the prime factorization, the Euler product φ(n) = n·∏(1−1/p), and the coprime residues laid out on a grid.
How to use the Euler's Totient φ(n) calculator
- Enter the values for your problem into the input fields.
- Read the result — it updates instantly as you type.
- Check the formula and the visual explanation to follow how the answer was found.
- Copy the page URL to share the exact calculation.
Common examples
- φ(36) = 12, from the factorization 36 = 2² · 3²
- φ(17) = 16 — for a prime p, φ(p) = p − 1
- φ(100) = 40, from 100 = 2² · 5²
- φ(1) = 1: the single integer 1 is coprime to itself
Frequently asked questions
How does the Euler's Totient φ(n) calculator work?
Enter your values and the calculator applies the exact mathematical method for this problem, showing the result together with the formula it used. Everything is computed with high-precision arithmetic, so the answer you see is not limited by ordinary floating-point rounding.
When would I use the Euler's Totient φ(n) calculator?
It is useful for homework and exam preparation, for checking work done by hand, and whenever a step in a larger problem needs this calculation done quickly and reliably.
How accurate are the results?
Calculations run at 30 significant digits of precision internally. Displayed values are rounded for readability, but the underlying result is far more precise than a typical hand or pocket-calculator computation.
Can I share a specific calculation with someone else?
Yes. Every value you enter updates the URL, so copying the address bar and sharing the link reopens the exact same calculation for whoever clicks it.