4447064

Appears in sequences

• Positive integers n such that phi(n) - d(n) = phi(n+1) - d(n+1) where d(n) is the number of divisors of n.at n=14A063069
• Numbers n such that |phi(n+1)-phi(n)| = |d(n+1)-d(n)|, where phi is Euler's totient function and d(n) = number of divisors of n.at n=22A066219
• Numbers n such that tau(n) = tau(n+1) and phi(n) = phi(n+1).at n=8A217773
• Numbers n such that phi(n) + d(n) = phi(n+1) + d(n+1), where phi(n) is the Euler totient function of n and d(n) the number of divisors of n.at n=16A259496