Euler's Totient Function

These sites will solve Euler's Totient Function. Euler's Totient Function, φ(n) or phi(n), is the number of integers >= 1 and < n who's greatest common divisor with n is 1.