The number 131 is the 32nd prime number. It is a Honaker prime because the sum of its digits (1+3+1) equals the sum of the digits of the index in the list of primes (3+2).
Write a function to list Honaker primes less than or equal to the input number.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers15
Suggested Problems
-
1466 Solvers
-
Numbers with prime factors 2, 3 and 5.
683 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1266 Solvers
-
Converting numbers back from extended form
129 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2157 Solvers
More from this Author323
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
