1073741827

Appears in sequences

• Next prime after 2^n.at n=30A014210
• Primes p+2^n arising in A056206.at n=30A056208
• Primes of the form 2^k + 3.at n=11A057733
• a(n) = 2^n + 3.at n=30A062709
• Smallest prime >= 8^n.at n=10A063768
• Smallest prime containing n zeros in its binary expansion.at n=28A066195
• a(n) = (2^(n-1) + prime(n+1)-prime(n))/2.at n=31A085431
• Smallest prime with exactly n consecutive zeros in the longest run of zeros in its binary expansion.at n=28A090587
• Smallest prime between 2^n and 2^(n+1), having a minimal number of 1's in binary representation.at n=29A091936
• A006530(x)=2 is a local minimum if x=2^n. Running upward with argument x, the largest prime divisor should increase. The value of first peak is a(n).at n=29A102643
• Smallest prime >= 2^n.at n=30A104080
• Smallest prime >= 4^n.at n=15A104082
• Prime nearest to 2^n. In case of a tie, choose the smaller.at n=30A117387
• Primes in the new Mersenne conjecture; odd primes of the form 2^k+-1 or 4^k+-3.at n=25A122834
• First occurrence of primes that are 2^k greater than the product of lesser twin primes.at n=29A128841
• a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3), with a(0) = 4, a(1) = 2, a(2) = 1.at n=30A133455
• Powers of 2 with 3 alternatingly added and subtracted.at n=30A140657
• Prime numbers of the form 4^k +- 3.at n=15A144232
• a(n) = smallest prime >= the smallest positive integer with exactly n divisors.at n=30A145344
• Inverse binomial transform of A070366.at n=31A146321