a(n) is the smallest prime m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.

A064023

a(n) is the smallest prime m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.

Terms

    a(0) =2a(1) =347a(2) =5861a(3) =225461a(4) =55541a(5) =4583a(6) =4457a(7) =117883a(8) =15559a(9) =151687a(10) =0a(11) =155383a(12) =0a(13) =5857a(14) =118589a(15) =126487a(16) =0a(17) =4789a(18) =0a(19) =134587a(20) =7687a(21) =0a(22) =0a(23) =25867a(24) =165457a(25) =0a(26) =34759a(27) =182687a(28) =0a(29) =38557

External references