def prime_pandigitals():
	#finds largest prime pandigital number
	length = 7 #8 and 9 digit pandigitals are divisible by 9
	while length > 3:
		potentials = pandigital_generator(length)
		potentials = [pandigital for pandigital in potentials if str(pandigital)[-1] not in [2,4,5,6,8]]
		potentials.sort()
		potentials.reverse()
		for potential in potentials:
			if prime(potential):
				return potential
		length -= 1
	return "No prime pandigitals found"
def divisible_pandigitals():
	pandigitals = pandigital_generator(9, 0)
	results = 0
	for pandigital in pandigitals:
		test_string = str(pandigital)
		if (int(test_string[7:10])%17==0 and
			int(test_string[6:9])%13==0 and 
			int(test_string[5:8])%11==0 and 
			int(test_string[4:7])%7==0 and 
			int(test_string[3:6])%5==0 and 
			int(test_string[2:5])%3==0 and 
			int(test_string[1:4])%2==0  
			):
			results += pandigital
			print pandigital
	return results