Project Euler Problem 10
This problem can be solved much faster with a Sieve of Eratosthenes algorithm, especially since you need every prime between 2 and n for you to sum them up.
However, there are a few optimizations you could make to your particular algorithm.

Dynamic Programming
Your code preforms some redundant calculations. For example, once you've checked if n % 2 is zero, you know n % 4, n % 6... are also zero. To avoid these calculations you could instead divide by only the prime numbers up to and including √n:
primes = [2] #define your array of prime numbers

def checkPrime(number):
    if number &lt; primes[0]:
        return False

    for p in primes: #only iterate through the primes
        if p &gt; number**0.5:
            break; #no need to keep going
        if number % p == 0:
            return False
    
    primes.append(number);
    return True

primes = [i for i in range(10) if checkPrime(i)]
print sum(primes)