136631

Appears in sequences

• Hard numbers: a(n) = smallest positive number m with f(m) = n, where f(m) is the smallest number of digits that are needed to construct m using only 1's, 2's and any number of +, -, *, ^ signs, not allowing concatenation of the digits.at n=15A060274
• Odd palindromes which are semiprimes with an even number of digits.at n=27A132288
• Numbers k such that k and k^2 use only the digits 0, 1, 3, 6 and 8.at n=24A136849
• Smallest number requiring n digits for its representation in the "Terrible Twos Problem" without using multidigit expressions.at n=14A260016
• Composite palindromes whose divisors > 1 are all nontrivial palindromes (i.e., palindromes with at least two digits).at n=29A329100