9199999999

Appears in sequences

• Smallest prime containing exactly n 9's.at n=9A037071
• a(n) = smallest prime that can be written in base 10 using just n n's.at n=9A069569
• Smallest prime whose product of digits is 3^n.at n=18A088653
• Smallest near-repdigit prime with digit n occurring n times, or 0 if no such prime exists.at n=8A160342
• Primes composed of digit {1,9} and with digit sum 9*k+1.at n=13A164890
• Primes with exactly nine 9's.at n=0A178558
• Smallest prime using the digit n exactly n times.at n=8A178559
• a(n) is the smallest number k such that digsum(k)/tau(k) = prime(n) where tau(k) is the number of divisors of k and digsum(k) is the sum of the digits of k.at n=12A240915
• Smallest prime numbers p of length n having a decimal expansion x(1)x(2)... x(n) such that there exists an index j where x(j) = 1 and x(i) = 9 for i<>j, or 0 if no such prime exists.at n=8A241021
• Smallest n-digit prime having at least n-1 digits equal to 9.at n=9A268707