def isCircularPrime(number):
length = len(str(number))
if (length==1):
return MathFunctions.checkIfPrime(number)
else:
for variation in list_of_variations(number):
if not MathFunctions.checkIfPrime(variation):
return False
return True
def prime_counter(order_in_primes):
current_num = 2
current_order_in_primes = 0
while True:
if MathFunctions.checkIfPrime(current_num):
current_order_in_primes += 1
if current_order_in_primes < order_in_primes:
current_num += 1
else:
break
return (current_num)
