Wechall_prime Factory (Training, Math)

Your task is simple:
Find the first and the primes above 1 million, whose separate digit sums are also prime.
As example take, which are a prime whose digit sum, 5, is also prime.
The solution is the concatination of the numbers,
Example:if The first number is 1,234,567
And the second is 8,765,432,
Your solution is 12345678765432

Solving:

The number of multiples of prime numbers hitting the table, in turn from small to eliminated primes.

defallsum (x): Sum=0 whileX:sum+ = X%10x= 10returnSumTotal= 2000000Prime=[]a= [1 forIinchrange (total)] forIinchRange (2, total):ifA[i]: prime.append (i) time= 2 while1: Num= time*IifNum >=Total: BreakA[num]=0 Time+ = 1Find=0 forIinchRange (1000000, total):ifIinchPrime andAllsum (i)inchPrime:Print(i) Find+ = 1iffind = = 2:             Break

Wechall_prime Factory (Training, Math)