Prime Palindrome Numbers

1# Helper function
2def is_prime(n):
3    if n < 2:
4        return False
5    for i in range(2, int(n ** 0.5) + 1):
6        if n % i == 0:
7            return False
8    return True
9
10def is_palindrome(n):
11    return str(n) == str(n)[::-1]
12
13# Find prime palindromes
14print("Prime palindromes 1-1000:")
15for num in range(1, 1001):
16    if is_prime(num) and is_palindrome(num):
17        print(num, end=" ")
18print()