Решение

def _build_primes(limit):
    is_p = bytearray(b"\x01") * (limit + 1)
    is_p[0] = is_p[1] = 0
    for i in range(2, int(limit ** 0.5) + 1):
        if is_p[i]:
            is_p[i * i : limit + 1 : i] = b"\x00" * ((limit - i * i) // i + 1)
    return is_p, [i for i, flag in enumerate(is_p) if flag]


_IS_P, _PRIMES = _build_primes(100_000)


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


def prime_divisors(x):
    res = []
    for p in _PRIMES:
        if p * p > x:
            break
        if x % p == 0:
            res.append(p)
            while x % p == 0:
                x //= p
    if x > 1:
        res.append(x)
    return res


c = 0
for x in range(8_007_494_155, 10**10):
    divs = prime_divisors(x)
    if not divs:
        continue
    M = min(divs) + max(divs)
    if M <= 80000 or not is_prime(M):
        continue
    if str(M).count("567") != 1:
        continue
    print(x, M)
    c += 1
    if c == 5:
        break