Java isPrime coding question

IsPrime.java

public class IsPrime {
    public static void main(String args[]) {
      System.out.println("6 (should be false):" + isPrime(6));
      System.out.println("11 (should be true):" + isPrime(11));
      
      // given a collection of numbers 11, 15, 2, 5, 6, 11
      // output the prime numbers, in sorted order, with no duplicates
      
    }
    
    
    public static boolean isPrime(Integer number) {
        // Corner case 
        if (number <= 1) 
            return false; 
  
        // Check from 2 to n-1 
        for (int i = 2; i < number; i++) 
            if (number % i == 0) 
                return false; 
  
        return true; 
    }
}