148667

Properties

Appears in sequences

• a(n) is the smallest prime m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.at n=41A064023
• a(n) = 2n+1 if 2n+1 is prime else a(n) = least prime of the form (2n+1)(2n+3)...(2n+2k-1) + 2.at n=24A110337
• Primes 6k - 1 at the end of the maximal gaps in A268928.at n=10A268930
• Primes of the form 6k - 1 at the end of first-occurrence gaps in A334543.at n=21A334545
• Prime numbersat n=13727