java prime,Calculating primes with long (Java)

I want to write a little program which is able to find the first 10 digit long prime number out of the euler number.

The number on the 99th place is the number I am searching for, but the isPrim() method does not respond correctly. Do you see what went wrong?

My Code

public class Main {

public static final String e = "27182818284590452353602874713526624977572470936999595749669676277240766303535475945713821785251664274274663919320030599218174135966";

public static void main(String[] args) {

System.out.println(e);

for (int i = 0; i < e.length() - 10; i++) {

String str = e.substring(i, i + 10);

long num = Long.parseLong(str);

boolean isPrim = isPrim(num);

if (isPrim == true) {

System.out.println("First prime: " + num);

break;

}

System.out.println(i + " " + str + " " + isPrim);

}

}

public static boolean isPrim(long number) {

if (number % 2 == 0) {

return false;

}

for (int j = 3; j * j < number; j+=2) {

if (number % j == 0) {

return false;

}

}

return true;

}

}