cstutoringcenter.com_Happy Primes

import math
def sum_of_digits(num):
    sum = 0
    for x in str(num):
        sum += int(x) ** 2
    return sum

def happy(num):
    while True:
        num = sum_of_digits(num)
        if num == 4: return False
        if num == 1: return True

def isPrime(num):
    if num == 2:return True
    if not num % 2:return False
    for x in xrange(2,int(math.ceil(math.sqrt(num)))+1):
        if not num % x:return False
    return True

sum = 0
inc = 2
count = 0
while True:
    if not inc % 10000:print inc
    if isPrime(inc) and happy(inc):
        sum += inc
        count += 1
    if count == 10000:break
    inc += 1
print sum