Number Palindromes.py

import Prime

digits = [0,1,2,3,4,5,6,7,8,9]

def get_palindromes(n):
    palindromes = []

    min = 10**(n/2 - 1)
    max = min*10

    for i in range (min,max):
        number = ''
        left = (str)(i)
        right = mirror_string(left)

        if n%2 != 0:
            for j in digits:
                number = left + (str)(j) + right
                palindromes.append((int)(number))
        else:
            number = left + right
            palindromes.append((int)(number))

    return palindromes

def mirror_string(s):
    temp = ''

    for i in s:
        temp = i + temp

    return temp

#print Prime.sum_of_digits(1437)

#'''
n = 5

palindromes = get_palindromes(n)
primey_palindromes = []

'''
for i in palindromes:
    print i

print len(palindromes), ' palindromes'
#'''

for i in palindromes:
    if Prime.is_primey(i):
        primey_palindromes.append(i)


'''
print 'Primey Palindromes:'
for i in primey_palindromes:
    print i
print len(primey_palindromes), ' primey palindromes'
#'''

'''
min = 10**n
max = 10*min
range = '(' + (str)(min) + '-' + (str)(max) + ')'
prime = Prime.get_primes_in_range(min,max)
print 'No. of primes in range ' + range + ':\t' + (str)(len(prime))
#'''