101011

Appears in sequences

• Least positive multiple of n written in base 5 using only 0 and 1.at n=36A004285
• Least positive multiple of n written in base 5 using only 0 and 1.at n=21A004285
• Least positive multiple of n written in base 6 using only 0 and 1.at n=18A004286
• Least positive multiple of n written in base 7 using only 0 and 1.at n=22A004287
• Primes written in base 2.at n=13A004676
• Roots of 'non-palindromic cubes remaining cubic when written backwards'.at n=8A035125
• Positive numbers having the same set of digits in base 2 and base 10.at n=38A037415
• Lexicographically earliest strictly increasing base 4 autovarious sequence: a(n) = number of distinct a(k) mod 4^n (written in base 4).at n=25A038113
• Lexicographically earliest strictly increasing base 5 autovarious sequence: a(n) = number of distinct a(k) mod 5^n (written in base 5).at n=21A038114
• Sums of 4 distinct powers of 10.at n=6A038446
• Coefficients of monic primitive irreducible polynomials over GF(3) listed in lexicographic order.at n=17A058949
• Sequence A019320 in binary.at n=14A063672
• 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=21A064795
• 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=11A064795
• Working in base 2, replace n with the concatenation of its prime divisors in increasing order.at n=11A064841
• Working in base 2, replace n with the concatenation of its prime divisors in increasing order.at n=21A064841
• Working in base 2, replace n with the concatenation of its prime factors (without repetition).at n=21A065016
• 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=39A066329
• 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=40A066330
• n-th prime prime(n) written in base (prime(n) (mod prime(n-1))).at n=12A072807