Euler's Totient Calculator
Enter n to find how many numbers up to n are coprime to it.
A whole number from 1 to 10^15.
Try
Result
You entered
Prime factorisation
Numbers from 1 to n sharing a factor with n
Show the work
Prime factorisation
The totient depends only on the distinct primes that divide , so factor it first.
Euler's product formula
Each prime dividing removes the fraction of the numbers, those that are multiples of , and the primes act independently.
Using
Result
So , and for a prime this is always .