Python判断素数升级版

这个有biggod能看看，教教我怎么去写，求住！久久我！谢谢

def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            return False
    return True

x = 0
for i in range(100, 1000):
    if is_prime(i) and all(is_prime(int(d)) for d in str(i)):
        x = x + 1
        print(i, end=' ')
        if x % 5 == 0:
            print()

运行效果

人工回答不易，如果满意，麻烦点个采纳，谢谢

import itertools as it

arr = set([n for n in [int(''.join([str(n) for n in v])) for v in it.permutations([2,2,2,3,3,3,5,5,5,7,7,7],3)] if len([x for x in range(2,n) if n % x == 0]) == 0])