2903041

Properties

Appears in sequences

• Compositorial numbers (A036691) + 1.at n=7A049650
• Smallest prime which is 1 more than the product of n distinct composite numbers.at n=7A081545
• Prime numbers arising from Schorn's proof that there are infinitely many primes.at n=21A104189
• Startorial primes.at n=8A110094
• Triangle T(n, k) = n!*binomial(n, k) - n! + 1, read by rows.at n=46A174690
• Triangle T(n, k) = n!*binomial(n, k) - n! + 1, read by rows.at n=53A174690
• Smallest prime factor of the n-th highly totient number (A097942(n)) plus 1.at n=45A209195
• Primes of the form n!/n# + 1, where n#=A034386(n) (primorial), listed with repetition.at n=7A222255
• Least prime greater than n-th compositorial.at n=7A277005
• Triangular array read by rows: T(n,k) = n!*k + 1, n >= 1, 1 <= k <= n.at n=43A362777
• Triangular array read by rows: T(n,k) is the least prime factor of n!*k + 1, n >= 1, 1 <= k <= n.at n=43A362778
• Triangular array read by rows: T(n,k) is the greatest prime factor of n!*k + 1, n >= 1, 1 <= k <= n.at n=43A362779
• Prime numbersat n=210314