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!)
A182683 a(n) = the smallest n-digit number with exactly 12 divisors, a(n) = 0 if no such number exists. 1
0, 60, 108, 1012, 10004, 100004, 1000012, 10000025, 100000012, 1000000025, 10000000012, 100000000004, 1000000000017, 10000000000004, 100000000000012, 1000000000000004, 10000000000000025, 100000000000000004, 1000000000000000017, 10000000000000000034, 100000000000000000012, 1000000000000000000025, 10000000000000000000004, 100000000000000000000004 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) = the smallest n-digit number of the form p^11, p^5*q, p^3*q^2 or p^2*q*r (p, q, r distinct primes), a(n) = 0 if no such number exists.
LINKS
FORMULA
A000005(a(n)) = 12.
a(n) <= A182684(n).
MATHEMATICA
Table[k=10^(n-1); While[k<10^n && DivisorSigma[0, k] != 12, k++]; If[k==10^n, k=0]; k, {n, 20}]
CROSSREFS
Sequence in context: A008887 A217738 A351548 * A174601 A306908 A252961
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 August 30 10:51 EDT 2024. Contains 375542 sequences. (Running on oeis4.)