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
-
4656 Solvers
-
Number of 1s in the Binary Representation of a Number
491 Solvers
-
433 Solvers
-
Sum of diagonal of a square matrix
1646 Solvers
-
Approximation of Pi (vector inputs)
285 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!