no input for this challenge
Write a code that outputs:
The first 10 prime numbers whose sum of their digits equal the number of bytes of your code
Let's say your code is
Co&%423@k"oo" which is
your code must output
[67, 139, 157, 193, 229, 283, 337, 373, 409, 463]
those are the first 10 prime numbers whose sum.... ok you got it!
If your code is
8 bytes, you must output
[17, 53, 71, 107, 233, 251, 431, 503, 521, 701]
You must only use the first 10^8 prime numbers
which means all your numbers must be <2038074743=10^8th prime
If you can't find 10 prime numbers in this range that fit your bytes, then you will have to adjust your code (you may even have to add some bytes!) in order to find a "working number of bytes"
Just output the 10 primes in any way you like
This is code-golf, so the shortest code in bytes win!