Python recursive method
class Solution:\n    def primePalindrome(self, n):\n        if Solution().palindrome(n) == True:\n            if Solution().prime(n) == True:\n                r
class Solution:\n    def primePalindrome(self, n):\n        if Solution().palindrome(n) == True:\n            if Solution().prime(n) == True:\n                return n\n            else:\n                Solution().primePalindrome(n+1)\n        else:\n            Solution().primePalindrome(n + 1)\n\n    def prime(self,n):\n        for i in range(2,n-1):\n            if n%i == 0:\n                return False\n        return True\n\n    def palindrome(self,n):\n        if str(n)== str(n)[::-1]:\n            return True\n        else:\n            return False\n
[]