All primes

[Artur]

Dear Members
I'm looking for members which have Mathematica Programme and can help in
finding the first number such that
(PrimeQ[2(n) + 1] == True) && (PrimeQ[4(
       n) + 1] == True) && (PrimeQ[6(n) + 1] == True) && (PrimeQ[8(
       n) + 1] == True) && (PrimeQ[10(n) + 1] == True) && (PrimeQ[12(
       n) + 1] == True) && (PrimeQ[14(n) + 1] == True) && (PrimeQ[16(
       n) + 1] == True) && (PrimeQ[18(n) + 1] == True) && (PrimeQ[20(
       n) + 1] == True) && (PrimeQ[22(n) + 1] == True)
these n is bigger than 4850000000000
I have Mathematica procedure which is 4000 much more quickest as above but  
for as big numbers PrimeQ working slow and will be good divided range of  
searching on few subranges and run each other on different computer.
If somebody can help let me know. I need information how long time  
computer can run without reset.
BEST REGARDS
ADRTUR JASINSKI