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
-
Numbers with prime factors 2, 3 and 5.
681 Solvers
-
Determine Whether an array is empty
810 Solvers
-
Calculate the area of a triangle between three points
3413 Solvers
-
193 Solvers
-
Check if a matrix is a palindrome in all directions
131 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!