GreatestPrimeFactor

public class LargestPrime {

    public static int getLargestPrime(int number) {

        if (number <= 1) {
            return -1;
        }

        boolean isPrime = false;
        int divisor = number;
        System.out.println("divisor equals " + divisor);
        int greatestFactor = 0;
        int numberOfFactors = 0;

        while (divisor > 1) {
            if (number % divisor == 0) {
                greatestFactor = divisor;
                System.out.println("greatest factor is " + greatestFactor);
                System.out.println("number is " + number);
                for (int i = 2; i < greatestFactor; i++) {
                    System.out.println("greatest factor in for " + greatestFactor);
                    System.out.println("i equals " + i);
                    if (greatestFactor % i == 0) {
                        System.out.println("found one " + i);
                        numberOfFactors++;
                        System.out.println("number of factors equals " + numberOfFactors);
                    }
            }

                if (numberOfFactors == 0) {
                    isPrime = true;
                }

            }
                divisor--;
            numberOfFactors = 0;
            if (isPrime) {
                break;
            }
        }


         if (isPrime) {
             return greatestFactor;
         }  else return -1;

    }
}