Prime Palindrome
Given an integer n, return the smallest prime palindrome greater than or equal to n.
An integer is prime if it has exactly two divisors: 1 and itself. Note that 1 is not a prime number.
- For example,
2,3,5,7,11, and13are all primes.
An integer is a palindrome if it reads the same from left to right as it does from right to left.
- For example,
101and12321are palindromes.
The test cases are generated so that the answer always exists and is in the range [2, 2 * 10^8].
Example 1
Input
n = 6Output
77 is the smallest prime palindrome greater than or equal to 6.Example 2
Input
n = 8Output
1111 is the smallest prime palindrome greater than or equal to 8.Constraints
- 1 <= n <= 10^8