The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182681 a(n) is the smallest n-digit number with exactly 11 divisors, a(n) = 0 if no such number exists. 1
0, 0, 0, 1024, 59049, 0, 9765625, 0, 282475249, 0, 25937424601, 137858491849, 2015993900449, 41426511213649, 420707233300201, 4808584372417849, 13422659310152401, 174887470365513049, 1822837804551761449, 15516041187205853449, 110462212541120451001, 1091533853073393531649 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
a(n) is the smallest n-digit number of the form p^10 (p = prime), a(n) = 0 if no such number exists.
LINKS
FORMULA
A000005(a(n)) = 11.
a(n) = min { 0 } union ( A030629 intersect [10^(n-1), 10^n-1] )
PROG
(PARI) a(n)=(10^n>n=nextprime(sqrtn(10^(n-1), 10))^10)*n \\ M. F. Hasler, Nov 27 2010
CROSSREFS
See A182682(n) - the largest n-digit number with exactly 11 divisors.
Cf. A030629 (numbers with 11 divisors).
Sequence in context: A195658 A264205 A321834 * A182682 A305941 A351198
KEYWORD
nonn,base
AUTHOR
Jaroslav Krizek, Nov 27 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 22:13 EDT 2024. Contains 372921 sequences. (Running on oeis4.)