Find out PRIME FACTORS. Is this the easiest way?

import java.util.Scanner;
public class PrimeFactor {
static int primeCheck = 1;
public static void main(String[] args) {
System.out.println("Enter a number whose Prime factors are desired: ");
Scanner numS = new Scanner(System.in);
int numPriFac = 0;
if(numS.hasNextInt()){
numPriFac = numS.nextInt();
}
System.out.println("All the Prime Factors of the entered number are:-");
for(int tap = 1; tap <= numPriFac; tap++){
if(numPriFac%tap == 0){
int count=0;
count++;
for(int primeTest = 2; primeTest < tap; primeTest++){
if(tap%primeTest == 0){
primeCheck = 1;
break;
}
else{
primeCheck = 0;
}
}
if(primeCheck == 0 || tap == 2){
System.out.print(tap+ " ");
}
}
}
}
}