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 Solvers17
Suggested Problems
-
Flip the main diagonal of a matrix
921 Solvers
-
1540 Solvers
-
Number of 1s in a binary string
11434 Solvers
-
How long do each of the stages of the rocket take to burn?
513 Solvers
-
Give me Hamming on five, hold the mayo
57 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!