Find all even divisors for a number

LargestModulus.java

import java.io.*;

/** Find all the even divisors of a number. */
class LargestModulus
{

    /**
     * Find all the divisors for a number (a.k.a., a dividend). The number must be a positive integer. It may be provided on the command line, or entered interactively when prompted.
     *
     * @param args if a command line parameter is detected, the first argument is used.
     */
    public static void main(final String[] args)
    {
        int num = 0;
        if (args.length == 0)
        {
            final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
            System.out.print("Enter an integer: ");
            try
            {
                num = Integer.parseInt(reader.readLine());
            }
            catch (final IOException e)
            {
                e.printStackTrace();
            }
        }
        else
        {
            num = Integer.parseInt(args[0]);
        }

        findEvenDivisors(num);
    }

    /**
     * Brute force method to find the even divisors for a number.
     *
     * @param dividend the number to find divisors for
     */
    public static void findEvenDivisors(final int dividend)
    {
        if (dividend > 0)
        {
            System.out.println("Even divisors for " + dividend);
            for (int i = dividend / 2; i > 0; i--)
            {
                final int modulus = dividend % i;
                if (modulus == 0)
                {
                    System.out.println(i + " x " + dividend / i + " = " + dividend);
                }
            }
        }
        else
        {
            System.out.println("ERROR: Number must be > 0");
        }
        System.out.println("=== End ===");
    }
}