|
|
A028842
|
|
Product of digits of n is a prime.
|
|
11
|
|
|
2, 3, 5, 7, 12, 13, 15, 17, 21, 31, 51, 71, 112, 113, 115, 117, 121, 131, 151, 171, 211, 311, 511, 711, 1112, 1113, 1115, 1117, 1121, 1131, 1151, 1171, 1211, 1311, 1511, 1711, 2111, 3111, 5111, 7111, 11112, 11113, 11115, 11117, 11121, 11131, 11151
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Range[11160], PrimeQ[Times@@IntegerDigits[#]] &] (* Jayanta Basu, Jun 02 2013 *)
|
|
PROG
|
(Sage) [x for x in range(10^5) if (prod(Integer(x).digits(base=10))) in Primes()] # Bruno Berselli, May 05 2014
(Scala) (1 to 10000).filter(n => List(2, 3, 5, 7).contains(n.toString.toCharArray.map(_ - 48).scanRight(1)(_ * _).head)) // Alonso del Arte, Apr 14 2020
(PARI) isok(n) = isprime(vecprod(digits(n))); \\ Michel Marcus, Apr 17 2020
(PARI) is(n)=my(d=digits(n), p); for(i=1, #d, if(d[i]==1, next); if(isprime(d[i]) && !p, p=1, return(0))); p \\ Charles R Greathouse IV, Apr 18 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|