1000001011

Appears in sequences

• Smallest n-digit prime containing only digits 0 and 1, or 0 if no such prime exists.at n=9A036929
• Primes whose sum of digits is 4.at n=26A062339
• Primes whose decimal representation also represents a prime in base 2.at n=20A089971
• Primes made up of 0's and four 1's only.at n=6A157711
• Primes sorted on digit sums, then on the primes.at n=30A157715
• Smallest n-digit prime with only digits 0 and 1, and having least digit sum (or 0, if no such prime exists).at n=9A168586
• Table read by antidiagonals: T(n,k) = smallest prime p containing only digits 0 and 1 with n 0's and k 1's, or 0 if no such p exists.at n=42A261173
• Binary representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 270", based on the 5-celled von Neumann neighborhood.at n=14A280464
• Binary representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 566", based on the 5-celled von Neumann neighborhood.at n=9A283062
• Binary representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 585", based on the 5-celled von Neumann neighborhood.at n=11A283136
• Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 262", based on the 5-celled von Neumann neighborhood.at n=24A287288
• Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 262", based on the 5-celled von Neumann neighborhood.at n=25A287288