Brute Force Only.
Code

# Code
```cpp []
class Solution {
private:
    bool sieve(int n){
        if(n<=1) return false;
        for(int i=2;i*i<=n;i++){
            if(n%i==0) return false;
        }
        return true;
    }
    bool isPalin(int n){
        string s = to_string(n);
        int l = s.length();
       int i=0,j=s.length()-1;
       while(i<j){
        if(s[i]!=s[j]){
            return false;
        }
        i++;
        j--;
       }
        return true;
    }

public:
    int primePalindrome(int n) {
        if (99899*1e2 <= n && n <= 1e8)
        return 100030001;
        int upper_limit = n;
        bool flag=false;
        while(flag==false){
            if(sieve(upper_limit)&&isPalin(upper_limit)){
                flag=true;
                break;
            }
            upper_limit++;
        }
        return upper_limit;
    }
};
```
['Math', 'C', 'Number Theory', 'C++', 'Python3']