Getting Prime Numbers

PrimeNumbers.java

public class PrimeNumber {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        
        //specific prime and nonprime numbers in range
        for (long i=1; i<50; ++i){        
            if(isPrime(i)){
                System.out.println(i + ": prime Number");
            }else{
               System.out.println(i + ":is not prime Number"); 
            }
        }
        //print out all primeNumbers in range
        Scanner input = new Scanner( System.in );
        long enterNum;
        System.out.print( "Enter number: " );        
        enterNum =input.nextLong();
        printPrimeNumbersInRange(enterNum);
        

    public static void printPrimeNumbersInRange(long inputNumber){
        for(long i = 0; i < inputNumber; i++){
            if(isPrime(i))
                System.out.println(i);
        }
    }
    
    public static boolean isPrime(long inputNumber){
        
        //0 and below are special cases
        if(inputNumber<1)return false;
        
        for(long i = 2; i < inputNumber; i++){
            if(inputNumber%i==0){
               // System.out.println(i);
                return false;
            }
         }
            
       }
        return true;
    }