Euler12(Java)

/*This is my solution to Problem #12 which asks: 
*What is the value of the first triangle number to have over five hundred divisors?
*This program was made in Java.
*/


public class Euler12 {
  public static void main(String args[]){
		long startTime = System.currentTimeMillis();
		int freq[]= new int [10000];
		long triNum = 3;
		int factors[] = {};
		long temp = 1;
		
		factors = getPrimes();
		
		
		for (long i = 3; i < 99999; i++)
		{
			triNum+=i;
			temp = triNum;
			System.out.println();				//helps with readability of output
			System.out.print(triNum + " ");

			for (int j = 0; j<factors.length; j++)
			{
				if (temp > factors[j] && factors[j] < 1000000)
				{
				while (temp%factors[j]==0)
				{
					temp = temp/factors[j];		//runs through each prime factor
					freq[j]++;
					//System.out.print(" " + factors[j] + " ");
					//System.out.print(" " + freq[j] + " ");
					if (temp == 1 || temp < factors[j])
					{
						temp = triNum;
						break;
					}
				}
				temp = triNum;
				//System.out.println(temp);
			}
				else
				{
					break;
				}

				//System.out.print(freq[j] + " ");
				
			}
			Euler12.DivFunction(freq);
			System.out.print(Euler12.DivFunction(freq));
			if (Euler12.DivFunction(freq)>=500)
			{
				break;
			}
			freq = WipeFreq();
		}

	}

	public static int[] WipeFreq()			//resets the divisor frequency count
	{
		int freq[] = new int[10000];
		return freq;
	}

	public static int DivFunction(int x[])		//calculates the number of divisors of each number
	{
		int div = 1;
		for (int j = 0; j < x.length; j++)
		{
			if (x[j] != 0)
			{
			//System.out.print("     " + x[0] + "\t");
			div*=x[j]+1;
			//System.out.println(div);
			}
			if (div >=500)			//stops when 500+ are found
			{
				break;
			}
		}
		//System.out.print(" " + div + " ");
		return div;

	}
	
public static int[] getPrimes()			//sieve to retrieve the prime numbers
	{
			int factors[] = new int [2000000];
			int base = 0;
			int sqrt = 1414;
			boolean[] Composite = new boolean[2000000+1];
			for (int m = 2; m <= sqrt; m++)
			{
				if (!Composite[m])
				{
					factors[base]=m;
					base++;
					for (int k = m * m; k <= 2000000; k +=m)
						Composite[k] = true;
				}
				
			}

			for (int m = sqrt; m <= 2000000; m++)
				if (!Composite[m])
				{
					factors[base]=m;
					base++;
				}
			return factors;
	}
}