⌘ Number & Reference · Tool

Euler Totient Calculator

Calculate Euler's totient φ(n): the count of positive integers up to n that are coprime to n.

Enter your figures

Enter the values below to calculate your result.

Calculation Results

Based on the figures you entered.

Euler's totient φ(n)
12
Formula
φ(n) = n × ∏(1 − 1/p), over the distinct prime factors p of n.

How to use this calculator

What to enter

Enter or select the following as requested: Positive integer. Follow the units, valid ranges, examples, and options displayed beside each field.

What the result means

The result follows the number property, divisibility rule, numeral system, or arithmetic operation named by the calculator. Check whether the input must be an integer, the selected base, sign conventions, and whether the output uses decimal, binary, hexadecimal, or another representation.

When to use it

Use this to check a number-theory problem or convert numeric representations. Verify input constraints and preserve the correct base when copying the result into another tool or calculation.