98942809

Appears in sequences

• Least number x such that gcd(phi(x), sigma(x)) = n.at n=28A073815
• Smallest number m such that GCD(a+b,a-b) = n, where a = sigma(m) and b = phi(m).at n=28A077102
• Least x=a(n) such that product of common prime-divisors [without multiplicity] of sigma(x) and phi(x) equals n; or 0 if n is not a squarefree number or if no such x exists. Among indices n only squarefree numbers arise because multiplicity of prime factors is ignored.at n=28A082057