C++ brute force
\nclass Solution {\npublic:\n    \n    bool ispal(int n){\n        string s=to_string(n);\n        int low=0,high=s.length()-1;\n        while(low<high){\n     
```\nclass Solution {\npublic:\n    \n    bool ispal(int n){\n        string s=to_string(n);\n        int low=0,high=s.length()-1;\n        while(low<high){\n            if(s[low]!=s[high]){\n                return false;\n            }\n            low++;\n            high--;\n        }\n        return true;\n    }\n    \n    bool isPrime(int n) {   \n    if (n <= 1) return false;\n    for (int i = 2; i <= sqrt(n); i++)\n        if (n % i == 0)\n            return false;\n    return true;\n}\n    \n    int primePalindrome(int n) {\n        for(int i=n;i<10000000;i++){\n            if(isPrime(i) && ispal(i)){\n                return i;\n            }\n        }\n        return 100030001;\n    }\n};\n```
[]