One Four Two Eight Five Seven

We define an integer \(n\) to be a cyclic prime if all its cyclic permutations are also prime numbers. Find the smallest cyclic prime number whose cyclic permutations are all larger than 500.

As an explicit example, 199933 is a cyclic prime because 199933, 999331, 993319, 933199, 331999, 319993 are all prime numbers.

×

Problem Loading...

Note Loading...

Set Loading...