A Python port of this:http://www.vogella.com/articles/JavaAlgorithmsPrimeFactorization/article.html

PrimeFactorsOf.java

import java.util.ArrayList;
import java.util.List;

public class PrimeFactorsOf {
  public static void main(String ... args) {
		System.out.println(primeFactorsOf(19252389595L));
	}
	
	static List<Long> primeFactorsOf(long val) {
		long n = val;
		List<Long> factors = new ArrayList<Long>();
		for (long i = 2; i <= n / i; i++) {
			while (n % i == 0) {
				factors.add(i);
				n /= i;
			}
		}
		if (n > 1) {
			factors.add(n);
		}
		return factors;
	}
}

primeFactorsOf.py

def primeFactorsOf(val):
    n = val
    factors = []
    i = 2
    while i <= (n / i):
        while n % i == 0:
            factors.append(i)
            n /= i
        i += 1
    if n > 1:
        factors.append(n)
    return factors

if __name__=="__main__":
    print primeFactorsOf(19252389595)