19979

Properties

Appears in sequences

• Primes of the form 666*k - 1.at n=10A063472
• Primes related to the nondecreasing subsequence of A007605 (sums of digits of primes).at n=41A067954
• Primes with all odd digits such that the next three primes also contain all odd digits.at n=20A068831
• Prime(n) and prime(n+3) use the same digits.at n=23A069795
• Primes such that least significant digit swapped with all other digits yields primes.at n=37A090934
• Primes with digit sum = 35.at n=3A106770
• Primes p such that p's set of distinct digits is {1,7,9}.at n=20A108384
• Positive integers i for which A112049(i) == 9.at n=4A112069
• Least prime whose absolute difference between the sum of its even decimal digits and the sum of its odd decimal digits is n.at n=35A114442
• Primes congruent to 32 mod 61.at n=33A142830
• Starting at a(1)=2, a(n) is the smallest prime larger than a(n-1) such that the sum of odd digits of a(n) is not smaller than the sum of odd digits of a(n-1).at n=39A158085
• Primes with integer arithmetic mean of digits = 7 in base 10.at n=33A285227
• Consider all ways of writing the composite Fibonacci number A090206(n+3) as product of two divisors d1*d2 = d3*d4 = ... The sequence a(n) gives the minimum sums of {d1+d2, d3+d4,...}.at n=21A287273
• Numbers k such that F(k)*F(k+1) - F(k+2) is prime, where F = A000045.at n=41A305415
• Values of n at which A323454 reaches a new record.at n=8A323463
• Prime numbers p such that 0 < pi(p;10,(9,1)) = pi(p;10,(3,9)) where pi(x;q,(a,b)) is the number of primes p_n <= x such that p_n == a (mod q) and p_(n+1) == b (mod q).at n=40A326897
• Smallest number that can be obtained by starting with 1 and applying "Choix de Bruxelles (version 2)" (see A323460) n times without backtracking or repeating.at n=17A334629
• Primes p*A007953(p)+1 for p in A338976.at n=38A338977
• a(n) = first prime of the A342444(n) consecutive primes summing to A342443(n).at n=4A342454
• Primes of the form 3*p+2 in which p and p+2 are twin primes.at n=42A391321