Easy C++ Solution
\nclass Solution {\npublic:\n    int is_prime(int n) {\n        if (n <= 1)\n            return 0; \n        int m = (int)(sqrt(n));\n        for (int i = 2; i 
```\nclass Solution {\npublic:\n    int is_prime(int n) {\n        if (n <= 1)\n            return 0; \n        int m = (int)(sqrt(n));\n        for (int i = 2; i <= m; i++)\n            if (n % i == 0)\n                return 0;\n        return 1;\n    }\n    \n    int reverse(int n){\n        int m = 0;\n        while (n) {\n            m = m*10 + n % 10;\n            n /= 10;\n        }\n        return m;\n    }\n    int is_palindrome(int n){\n        return n == reverse(n);\n    }\n    \n    int primePalindrome(int N) {\n        if (1e7 <= N and N <= 1e8)\n            N = 100030001;\n        while(1){\n            while(is_palindrome(N) == 0) N++;\n            if (is_prime(N))\n                return N;\n            N++;\n        }\n    }\n};\n```
[]