Puzzle 1058 Alike the puzzle 1057

Carlos Rivera poses the following puzzle alike the Puzzle 1057:

Let P to be a zeroless prime written as P=SR, where R is the rightmost digit of P.

Then X={SR, S1R, S2R...} are all distinct primes, where:

S1 is obtained changing the rightmost digit of S to the leftmost position of S

S2 is obtained changing the rightmost digit of S1 to the leftmost position of S1

and so on...

An extra condition is that P is the minimal prime of the set X.

Obviously for a prime P of K digits, using this rule you can obtain at the most a total of K-1 distinct primes including P.

Example: For P=2648286353 10 digits, then {2648286353, 5264828633, 3526482863, 6352648283, 8635264823, 2863526483, 8286352643, 4828635263, 6482863523} are 9 distinct primes.

Q. Send the largest prime P of this type you can get.