4324321

Properties

Appears in sequences

• Smallest number that is centered polygonal in exactly n ways.at n=32A063773
• Numbers k > 1 such that sigma(phi(k))/sigma(k) > sigma(phi(j))/sigma(j) for all 1 < j < k.at n=31A067573
• Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=12A070858
• Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=13A070858
• Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=14A070858
• Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=15A070858
• Primes p such that p-1 is a highly composite number.at n=18A072826
• Smallest prime == 1 (mod (product of next n numbers)).at n=4A088106
• Primes p such that p-1 has more divisors than any smaller prime-1.at n=37A103199
• a(n) = smallest prime congruent to 1 mod A051426(n).at n=12A159293
• a(n) = smallest prime congruent to 1 mod A051426(n).at n=13A159293
• a(n) = smallest prime congruent to 1 mod A051426(n).at n=14A159293
• a(n) = smallest prime congruent to 1 mod A051426(n).at n=15A159293
• Primes of the form colossally abundant number + 1.at n=6A176903
• Least k>1 such that the Euler totient function of powers k^e, 1 <= e <= n, are divisible by the number their divisors, d(k^e).at n=11A272857
• Least k>1 such that the Euler totient function of powers k^e, 1 <= e <= n, are divisible by the number their divisors, d(k^e).at n=12A272857
• Least k>1 such that the Euler totient function of powers k^e, 1 <= e <= n, are divisible by the number their divisors, d(k^e).at n=13A272857
• Least k>1 such that the Euler totient function of powers k^e, 1 <= e <= n, are divisible by the number their divisors, d(k^e).at n=14A272857
• Numbers k such that sigma(phi(k))/k > sigma(phi(m))/m for all m < k, where sigma is the sum of divisors function (A000203) and phi is Euler's totient function (A000010).at n=33A293059
• Prime numbersat n=304409