6
Unfortunately, I don't speak python so I can't provide any code but there's a couple of things I see that can be improved algorithmically:
In isPrime start checking if it's divisible by two, then start check 3 and increase by two on each step. So instead of checking 2,3,4,5,6... you check 2,3,5...