This problem is killing me
Code\n\nclass Solution:\n    def primePalindrome(self, n: int) -> int:\n        def isPrime(num):\n            # Key step 2:\n            # Only need to check t
# Code\n```\nclass Solution:\n    def primePalindrome(self, n: int) -> int:\n        def isPrime(num):\n            # Key step 2:\n            # Only need to check the first sqrt(num) number of divisors\n            for i in range(2, int(num ** 0.5) + 1):\n                if not num % i: return False\n            return True\n\n        if n < 3: return 2\n        if 7 < n <= 11: return 11\n        i = 2\n        while True:\n            # Key step 1:\n            # Only need to check the number with the odd length of digits\n            # Because the only palindrome with the even length of digits is 11\n            num = int(str(i) + str(i)[::-1][1:])\n            if num >= n and isPrime(num): return num\n            i += 1\n        \n```
['Python3']