login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A058627
Numbers n such that phi(n) = product of the digits of n.
4
1, 24, 26, 87, 168, 388, 594, 666, 1998, 2688, 5698, 5978, 6786, 7888, 68796
OFFSET
1,2
COMMENTS
Sequence is finite because for n large enough phi(n) > n / (exp(EulerGamma) * log(log(n))+3/log(log(n))), while pod(n) < 9*9^ceiling(log(n)/log(10)). If a(16) exists, it holds 10^13 < a(16) < 10^64. - Giovanni Resta, Apr 22 2014
REFERENCES
C. A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Oxford University Press, NY 2000, Chapter 72, 'Apocalyptic Numbers,' Pages 176 - 178.
LINKS
C. A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Zentralblatt review
EXAMPLE
Phi(666) = 6*6*6
MATHEMATICA
Select[ Range[ 10^7], EulerPhi[ # ] == Times @@ IntegerDigits[ # ] &]
CROSSREFS
Sequence in context: A295007 A053968 A336237 * A286130 A279427 A116203
KEYWORD
nonn,base,fini
AUTHOR
Robert G. Wilson v, Dec 26 2000
STATUS
approved