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 Solvers16
Suggested Problems
-
2249 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
765 Solvers
-
Number of odd and even elements within matrix
161 Solvers
-
247 Solvers
-
Natural numbers in string form
1942 Solvers
More from this Author325
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!