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
-
Find state names that end with the letter A
1198 Solvers
-
All your base are belong to us
579 Solvers
-
Sum the elements in either diagonal of a square matrix
222 Solvers
-
93 Solvers
-
Convert to Binary Coded Decimal
154 Solvers
More from this Author326
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!