10000005

Appears in sequences

• a(n) = smallest n-digit number with exactly n divisors, or 0 if no such number exists.at n=7A070844
• Smallest n-digit multiple of the n-th composite number.at n=7A079822
• Triangle, read by rows, in which the n-th row contains n smallest n-digit numbers.at n=33A081551
• a(n) = 10^n + 5.at n=7A133472
• Numbers k such that there are 15 digits in k^2 and for each factor f of 15 (1,3,5) the sum of digit groupings of size f is a square.at n=5A153751
• Smallest n-digit number that is divisible by exactly 3 primes (counted with multiplicity).at n=7A180922
• a(n) is the smallest n-digit number with exactly 8 divisors, a(n) = 0 if no such number exists.at n=7A182675
• Numbers k such that the digits of k^2 are a subsequence of the digits of k^3.at n=31A362002