C++ solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    bool isPrime(int n)\n    {\n        for(int i=2;i<=sqrt(n);i++)\n        {\n            if(n%i==0) return false;\n        }\n        return true;\n    }\n    bool isPalindrome(int n)\n    {\n        int x =n;\n        int rev =0;\n        while(x>0)\n        {\n            int num = x%10;\n            x = x/10;\n            rev = rev*10 + num;\n        }\n        return n==rev;\n    }\n    int primePalindrome(int n) {\n        if(n<=2) return 2;\n        if(n >= 9989900) return 100030001;\n        for(int i =n;i<=INT_MAX;i++)\n        {\n\n            if(isPrime(i) && isPalindrome(i)) return i;\n        }\n        return -1;\n    }\n};\n```
['C++']