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
-
Sum all integers from 1 to 2^n
17813 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
762 Solvers
-
Determine if input is a perfect number
266 Solvers
-
Detect a number and replace with two NaN's
200 Solvers
-
562 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!
