challenge-168/lubos-kolouch/python/ch-2.py


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

from sympy import factorint, isprime


def home_prime(n):

    while not isprime(n):
        factors = factorint(n)

        my_sum = ""
        for (my_factor, repetition) in factors.items():
            my_sum += str(my_factor) * repetition

        n = int(my_sum)

    return n


assert home_prime(2) == 2
assert home_prime(10) == 773