---
title: "866. Prime Palindrome"
url: "https://laigary.com/interview/coding/866-prime-palindrome"
type: "note"
section: "coding"
date: "2023-01-29"
updated: "2023-01-29"
tags: ["Palindrome", "Classic"]
---

# 866. Prime Palindrome

[866\. Prime Palindrome](https://leetcode.com/problems/prime-palindrome/)

[9\. Palindrome Number](/interview/coding/9-palindrome-number) 和 [204\. Count Primes](/interview/coding/204-count-primes) 的結合。

```python
class Solution:

    def isPalindrome(self, n):
        if n < 0 or (n % 10 == 0 and n != 0):
            return False
        left = n
        right = 0
        while left > right:
            right = right * 10 + left % 10
            left //= 10
        return left == right or left == right //10

    def isPrimeNumber(self, n):
        return n > 1 and all(n % d for d in range(2, int(n**.5) + 1))

    def primePalindrome(self, n: int) -> int:
        while True:
            if self.isPalindrome(n) and self.isPrimeNumber(n):
                return n
            n += 1
            if 10**7 < n < 10**8:
                n = 10**8

```