Euler Totient Calculator

φ(n) = count of coprimes

All Tools

2^2 × 3

φ(12)

φ(n)/n ratio0.333333

Σφ(d) for d|n12 = n ✓

Coprimes to 12

15711

Table

φ(1)=1

φ(2)=1

φ(3)=2

φ(4)=2

φ(5)=4

φ(6)=2

φ(7)=6

φ(8)=4

φ(9)=6

φ(10)=4

φ(11)=10

φ(12)=4

Loading tool...

About Euler Totient Calculator

An Euler totient function calculator computing φ(n) = n·Π(1−1/p) for prime p|n. Shows prime factorization, coprime count, and totient properties. Verifies Euler's theorem: aᶲ⁽ⁿ⁾≡1 (mod n). All calculations are client-side. Essential for RSA and number theory.

Euler Totient Calculator Features

φ(n)
Prime factorization
Coprime list
Euler theorem
Properties

More Calculators Tools

Explore all 639 other calculators tools available on Generatr

View all 639 calculators tools