Javada Islem Suresi Sorunu

import java.util.ArrayList; 
  public class ThePrimes { 
   
  	public static boolean isPrimeFactor( int number) { 
  		boolean isPrime = true; 
  		for( int i = 2; i < number; i++) { 
  			if (number % i == 0) //to check if it is prime factor 
  				isPrime = false; 
  		} 
  		return isPrime; 
  	} 
  	public static void main(String[] args) { 
  		 
  		ArrayList<Integer> primes = new ArrayList<Integer>(); 
  		int i, n; 
  		i = 0; //if a prime factor is found, adding 1 to i 
  		n = 2; //first prime factor is 2 
  		while( i < 2000000) { //to find 2M.th prime. 
  			if( isPrimeFactor( n)){ 
  				i++; 
  				primes.add( n); 
  			} 
  			n++; 
  		} 
  		System.out.print( primes.get( primes.size()-1)); //Last index 
  	} 
  }