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 Solvers18
Suggested Problems
-
252 Solvers
-
429 Solvers
-
Rounding off numbers to n decimals
5842 Solvers
-
Approximation of Pi (vector inputs)
285 Solvers
-
Replace secondary diagonal elements of a square array
189 Solvers
More from this Author330
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!