101111

Properties

Appears in sequences

• Least positive multiple of n written in base 5 using only 0 and 1.at n=16A004285
• Primes written in base 2.at n=14A004676
• Primes whose greatest digit is 1.at n=3A020449
• Smallest n-digit prime containing only digits 0 and 1, or 0 if no such prime exists.at n=5A036929
• Primes having only {0, 1, 2} as digits.at n=26A036953
• Smallest prime containing exactly n 1's.at n=5A037055
• Numbers k such that k is a substring of its base-2 representation.at n=28A038102
• Sums of 5 distinct powers of 10.at n=1A038447
• Primes p = d_1 d_2 ... d_k in base 10 such that for some base b, p = Sum_{i = 1..k} b^d_i.at n=2A048177
• Coefficients of irreducible polynomials over GF(2) listed in lexicographic order.at n=10A058943
• Coefficients of primitive irreducible polynomials over GF(2) listed in lexicographic order.at n=8A058947
• Primes having only {0, 1, 8} as digits.at n=26A061247
• Primes whose sum of digits is 5.at n=29A062341
• Home primes in base 2: primes reached when you start with n and (working in base 2) concatenate its prime factors (A048985); repeat until a prime is reached (or -1 if no prime is ever reached).at n=17A064795
• Working in base 2, replace n with the concatenation of its prime divisors in increasing order.at n=17A064841
• Working in base 2, replace n with the concatenation of its prime factors (without repetition).at n=34A065016
• Near-repunit primes that contain the digit 0.at n=2A065074
• a(n) is the smallest prime ending in exactly n 1's.at n=3A065821
• Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 1, 3, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=42A066329
• Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=44A066330