Specific number

[apollo abel]

Hi, i have written a program, i can tell which numbers are perfect, abundant or deficient. i can tell the percentages, and i can tell how many of these numbers i have.
However, i don't know how to get an specific number, for example, if i enter 500, there are 3 perfect numbers, 6, 28, and 496. i need to be able to printout the actual numbers.

public class NumPAD
{
// instance variables
private int sum; // sum of the factors
private int num; // the number entered
private double perfectCount; // perfect numbers count
private double abundantCount; // abundant numbers count
private double deficientCount; // deficient numbers count
private double total; // sum of all types of numbers
private String name; // the user's name

/**Creates the class object 
 * @param num user's name 
 * @param name the user's name
 */
public NumPAD(int num, String name)
{
// variables are initialized
this.num = num;
this.name = name;
}

/**
 * Returns the sum of the factors 
 * @return the sum of the factors 
 */
public int sumFactors(int num)
{
sum = 0;
// it creates a for loop, it cannot go past half the numbers entered
for(int i =1; i <= num/2; i++)
{
// filters the factors
if(num % i ==0)
{
// sum gets all the factors and adds them up
sum = sum + i;
}
}
return sum;
}

/**
 * Returns the number entered
 * @return the number entered
 */
public int getNum()
{
return num;
}

/**
 * Returns the user's name
 * @return the user's name
 */
public String getName()
{
return name;
}
/**
 * Creates a variable to count the perfect numbers
 */
public void setPerfectCount()
{
perfectCount++;
}
/**
 * Creates a variable to count the abundant numbers
 */
public void setAbundantCount()
{
abundantCount++;
}
/**
 * Creates a variable to count the deficient numbers
 */
public void setDeficientCount()
{
deficientCount++;
}
/**
 * Returns the total of all type numbers
 * @return the total of all type numbers
 */
public double getTotal()
{
total = perfectCount+abundantCount+deficientCount;
return total;
}
/**
 * Returns the perfect count
 * @return the perfect count
 */
public double getPerfectCount()
{
return perfectCount;
}
/**
 * Returns the abundant count
 * @return the abundant count
 */
public double getAbundantCount()
{
return abundantCount;
}
/**
 * Returns the deficient count
 * @return the deficient count
 */
public double getDeficientCount()
{
return deficientCount;
}


}
// the test class
 
import java.util.Scanner;
import java.text.DecimalFormat;
public class NumPADTester
{
// a class that gets the numbers and percentages of perfect, abundant and
// deficient numbers
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
String exit = "1";
// a do-while loop to run until the user's gets bored
do
{
// asks for the user's name
System.out.println("What is your name? ");
String name = input.next();
System.out.println();
// asks the user to enter a number
System.out.println("Enter a number: ");
int num = input.nextInt();
System.out.println();

// constructor using the user's input
NumPAD howdy = new NumPAD(num,name);

// it creates a for-loop
for(int i = 1; i <= num; i++)
 {
   System.out.print(i);
//System.out.println(howdy.getNum());
//System.out.println(howdy.sumFactors(i));

   // it gets the perfect numbers
   if (i == howdy.sumFactors(i))
   {
    System.out.println(" PERFECT");
    howdy.setPerfectCount();
   }
   // it gets the abundant numbers
   else if(i < howdy.sumFactors(i))
   {
    System.out.println(" ABUNDANT");
    howdy.setAbundantCount();
   }
   // it gets the deficient numbers
   else 
   {
   System.out.println(" DEFICIENT");
   howdy.setDeficientCount();
   }
   
  }
  System.out.println();
  
  DecimalFormat round = new DecimalFormat("0.##");
  System.out.println();
  // it gets the percentages of perfect numbers
  System.out.println("The percentage of perfect numbers is: "
  + round.format(howdy.getPerfectCount()/howdy.getTotal()*100));
  System.out.println();
  // it gets the percentages of abundant numbers
  System.out.println("The percentage of abundant numbers is: "
  + round.format(howdy.getAbundantCount()/howdy.getTotal()*100));
  System.out.println();
  // it gets the percentages of deficient numbers
  System.out.println("The percentage of deficient numbers is: "
  + round.format(howdy.getDeficientCount()/howdy.getTotal()*100));
  System.out.println();
  // it gets the amount of perfect numbers
  System.out.println("The number of perfect numbers is: "
  +(int)howdy.getPerfectCount());
  System.out.println();
  // it gets the amount of abundant numbers
  System.out.println("The number of abundant numbers is: "
  +(int)howdy.getAbundantCount());
  System.out.println();
  // it gets the amount of deficient numbers
  System.out.println("The number of deficient numbers is: "
  +(int)howdy.getDeficientCount());
  System.out.println();
  //a do-while loop that asks the user of he/she wants to enter another
  // number
  do
{

System.out.print("Do you want to enter another number? (1)Yes, (2)No ");
exit = input.next();
}
while(!exit.equals("1") && !exit.equals("2"));
System.out.println();
if(exit.equals("2"))
{
System.out.println("Goodbye " + howdy.getName());
break;
}
}
while(exit.equals("1"));


}
}

Any ideas on how to get an specific number??
thanks in advance.

[apollo abel]

NVM i figured out