Euler30(Java)

/*This is a solution to the Euler problem #30 which seeks a solution to the following:
*Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.
*This solution was again created in Java.
*/


public class Euler30 {

  public static void main(String[] args) {
		
		int num[] = new int [5];
		int numCompare[] = new int [10];
		int sum = 0;
		int realSum = 0;
		boolean test;
		String number;

		
		for (int i = 2; i < 350000; i++) {
			number = Integer.toString(i);
			num = toArray(number);
			sum = Power5(num);
			numCompare = ArrayTime(sum);
			test = Compare (num, numCompare);
			
			if (test == true) {
				realSum+=sum;
				System.out.println(sum);
			}
		}
		System.out.println(realSum);

	}
	
	
	
	public static int[] toArray (String x) {		//takes each number starting from 2 and parses it into 
		int num[] = new int [10];			// an array.  for example the number 132 would be  
		String dig;					// turned into an array [1][3][2].  													                    
		for (int i = x.length(); i >0; i--) {		//This makes accessing it's individual elements
			dig = x.substring(i-1,i);
			//System.out.println(dig);
			num[x.length()-i] = Integer.parseInt(dig);
		}
		return num;
	}
	
	public static int Power5 (int x[]) {			//takes the num array created and gives the sum of 
								//the 5th power of each digit in the number array.
		int sum = 0;
		
		for (int i = 0; i < 6; i++) {
			sum += x[i]*x[i]*x[i]*x[i]*x[i];
		}
		return sum;
	}
	
	public static int[] ArrayTime (int x) {			//takes the sum and turns it into an array as well
		int num[] = new int [10];
		String dig, sub;
		
		dig = Integer.toString(x);

		for (int i = dig.length(); i >0; i--) {
			sub = dig.substring(i-1,i);

			num[dig.length()-i] = Integer.parseInt(sub);
		}
		return num;
	}
	
	public static boolean Compare (int x[], int y[]) {	//compares the arrays to check for equality
		
		boolean test = true;
		
		for (int i = 0; i < 7; i++) {
			if (x[i] != y[i]) {
				test = false;
			}
		}
		return test;
	}
}