Java program to check if a given number is prime:
public class PrimeChecker {
public static void main(String[] args) {
int number = 17; // Change this number to check for a different number
if(isPrime(number)) {
System.out.println(number + " is a prime number.");
} else {
System.out.println(number + " is not a prime number.");
}
}
public static boolean isPrime(int number) {
if (number <= 1) {
return false;
}
if (number <= 3) {
return true;
}
if (number % 2 == 0 || number % 3 == 0) {
return false;
}
for (int i = 5; i * i <= number; i = i + 6) {
if (number % i == 0 || number % (i + 2) == 0) {
return false;
}
}
return true;
}
}
```
This program defines a method `isPrime` that takes an integer `number` as input and returns `true` if the number is prime, and `false` otherwise. In the `main` method, we call this method with `number = 17`, but you can change the value of `number` to check for a different number.