I like the bitwise check to satisfy all 2-primes.
I think for more performance you could initialize an int for Math.sqrt(n) and add n > 1 && t <= max in the while loop.