simple and easy solution 😍❤️‍🔥
# if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n# Code\n\nclass Solution {\npublic:\n    bool isPrime(int n)\n    {\n        for(int i=2;i*i<=n;i++)\n  
# # if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n# Code\n```\nclass Solution {\npublic:\n    bool isPrime(int n)\n    {\n        for(int i=2;i*i<=n;i++)\n            if(n%i==0) return false;\n        return true;\n    }\n    bool isPalindrome(string s)\n    {\n        int i = 0, j = s.size()-1;\n        while(i<=j)\n        {\n            if(s[i] != s[j]) return false;\n            i++, j--;\n        }\n        return true;\n    }\n    int primePalindrome(int n) \n    {\n        if(n <= 2) return 2;\n        if(n >= 9989900) return 100030001;\n        if(n <= 11 and isPrime(n)) return n;\n\n        for(int i=n+1;i<=2e8+5;i++)\n        {\n            if(isPrime(i) and isPalindrome(to_string(i)))\n                return i;\n        }\n        return -1;\n    }\n};\n\n```
['Math', 'Number Theory', 'C++']