my python solution
Code\npython3 []\nclass Solution:\n    def primePalindrome(self, n: int) -> int:\n        def p(x):\n            if x < 2: return 0\n            for i in range(
# Code\n```python3 []\nclass Solution:\n    def primePalindrome(self, n: int) -> int:\n        def p(x):\n            if x < 2: return 0\n            for i in range(2, int(x**0.5)+1):\n                if x % i == 0: return 0\n            return 1\n\n        def g(x):\n            s =str(x)\n            return int(s + s[-2::-1])\n\n        if 8 <=n<= 11:return 11\n\n        for l in range(1, 6):\n            for r in range(10**(l-1), 10**l):\n                num = g(r)\n                if num >= n and p(num): return num\n\n```
['Python3']