This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A108871 Numbers n such that the number of digits required to write the prime factors of n is equal to the number of divisors of n. 0

%I

%S 11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,143,

%T 187,202,206,209,214,218,221,226,247,253,254,262,274,278,298,299,302,

%U 303,309,314,319,321,323,326,327,334,339,341,346,358,362,377,381,382,386

%N Numbers n such that the number of digits required to write the prime factors of n is equal to the number of divisors of n.

%C 190333 has 10 divisors and 10 digits in its prime factorization. What is the next term in this sequence with more divisors and digits?

%e 143 is a term because it takes 4 digits to write its prime factorization

%e 143=11*13 and has 4 divisors [1, 11, 13, 143].

%Y Cf. A076649.

%K base,easy,nonn

%O 1,1

%A Jason Earls (zevi_35711(AT)yahoo.com), Jul 13 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .