Compare calculators
Both calculators run independently — change the inputs on either side to compare results.
Number Theory
Euler's Totient Function
Calculate Euler's totient φ(n) — the count of integers from 1 to n that share no common factor with n. Essential for RSA key generation and number theory problems.
Fill in the required fields to see your result.
Number Theory
Perfect Number Calculator
Determine whether any integer is perfect, abundant, or deficient based on its proper divisor sum. Use it to explore number theory or verify known perfect numbers like 6 and 28.
Fill in the required fields to see your result.
Key differences
| Euler's Totient Function | Perfect Number Calculator | |
|---|---|---|
| Category | Number Theory | Number Theory |
| Inputs required | 1 | 1 |
| Result | φ(n) | Number Classification |
| What it does | Calculate Euler's totient φ(n) — the count of integers from 1 to n that share no common factor with n. Essential for RSA key generation and number theory problems. | Determine whether any integer is perfect, abundant, or deficient based on its proper divisor sum. Use it to explore number theory or verify known perfect numbers like 6 and 28. |