|
Search: id:A070844
|
|
|
| A070844 |
|
Smallest n-digit number with exactly n divisors. |
|
+0
6
|
|
| 1, 11, 121, 1003, 14641, 100017, 1771561, 10000005, 100020001, 1000000016
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
If n is a prime then a(n) = p^(n-1) where p is smallest prime > 10^(n-1).
|
|
MATHEMATICA
|
For[n=1, n<10, n++, k := 10^(n-1); While[Not[Length[Divisors[k]] == n], k++ ]; Print[k]] (Steinerberger)
|
|
CROSSREFS
|
Cf. A070845.
Adjacent sequences: A070841 A070842 A070843 this_sequence A070845 A070846 A070847
Sequence in context: A015958 A068179 A006940 this_sequence A073913 A080445 A033867
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 12 2002
|
|
EXTENSIONS
|
One more term from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 08 2003
a(7)-a(10) from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 06 2006
|
|
|
Search completed in 0.002 seconds
|
