Juicy highly composite number needs factorization

[kevolegend]

Replace "/" with "//" (2 times)

#!/usr/bin/python3
import math..

def primeFactors(n):.
    # Print the number of two's that divide n
    while n % 2 == 0:
        print (2,end=" ")
        n = n // 2

    # n must be odd at this point.
    # so a skip of 2 ( i = i + 2) can be used.
    for i in range(3, int(math.sqrt(n))+1, 2):.
        # while i divides n , print i ad divide n.
        while n % i== 0:
            print (i,end=" ")
            n = n // i

    # Condition if n is a prime.
    # number greater than 2.
    if n > 2:.
        print (n)

n = 10334475851656087128243643125471284565310588797552748096314114788137761206785997576812685774304768000
n = 100
primeFactors(n)

you the man!