Enter a number to calculate its Euler's Totient Function value.
Calculate the Value of Euler's Totient Function
Result
What Is Euler's Totient Function?
Euler's Totient Function, denoted as \( \phi(n) \), is a fundamental concept in number theory. It calculates the count of positive integers less than or equal to \( n \) that are coprime with \( n \) (i.e., integers that share no common factors with \( n \) other than 1).
How to Calculate Euler's Totient Function?
Factorize \( n \): Decompose \( n \) into its prime factors:
\( n = p_1^{k_1} \times p_2^{k_2} \times \ldots \times p_m^{k_m} \)
Here, \( p_1, p_2, \ldots, p_m \) are the distinct prime factors of \( n \).
Apply the Formula: The Euler's Totient Function is calculated as:
\( \phi(n) = n \left(1 - \frac{1}{p_1}\right)\left(1 - \frac{1}{p_2}\right) \ldots \left(1 - \frac{1}{p_m}\right) \)