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 enteredn=1n = 1

1\displaystyle 1

Prime factorisation

1\displaystyle 1

Numbers from 1 to n sharing a factor with n

0\displaystyle 0
Show the work
  1. Euler's totient function

    φ(n)\varphi(n) counts the numbers from 11 to nn that have no common factor with nn other than 11. For n=1n = 1 the only candidate is 11 itself, and gcd⁡(1,1)=1\gcd(1, 1) = 1.

    φ(1)=1\varphi(1) = 1
  2. Result

    So φ(1)=1\varphi(1) = 1.

Worked examples