Input a Number and show If it is a Special Number or Not

Special_Integer.java

/*
A special Integer is a positive integer(without leading zeroes)
which is a prime number as well as satisfies the following clause:

The square of the number and the square of its reverse are reverse to each other.

Eg:
    INPUT: 13
    OUTPUT: 13 is Prime
            Reverse: 31
            Square of 13 : 169
            Square of 31 : 961
            169 = Reverse of 961
            13 is a Special Integer

    INPUT: 103
    OUTPUT: 103 is Prime
            Reverse: 301
            Square of 103 : 10609
            Square of 301 : 90601
            10609 = Reverse of 90601
            103 is a Special Integer
*/

import java.util.Scanner;

class Special_Integer {

    private boolean isPrime(int number) {
        int count = 0;

        for (int i = 2; i < number; i++)
            if (number % i == 0)
                return false;

        return true;

    }

    private int reverse(int number) {
        int reverse = 0;

        while (number != 0) {
            reverse = reverse * 10 + number % 10;
            number = number / 10;
        }

        return reverse;
    }

    public static void main() {
        Scanner sc = new Scanner(System.in);

        System.out.println("Enter the number");
        int number = sc.nextInt();

        Special_Integer obj = new Special_Integer();

        if (!obj.isPrime(number)) {
            System.out.println("Invalid Input!");
            return;
        }

        System.out.println("The number " + number + " is Prime");

        int reverse = obj.reverse(number);

        System.out.println("Reverse: " + reverse);

        System.out.println("Square of " + number + " = " + (int) Math.pow(number, 2));
        System.out.println("Square of " + reverse + " = " + (int) Math.pow(reverse, 2));

        if ((int) Math.pow(number, 2) == obj.reverse((int) Math.pow(reverse, 2))) {
            System.out.println((int) Math.pow(number, 2) + " = Reverse of " + (int) Math.pow(reverse, 2));
            System.out.println(number + " is a Special Integer");
        } else {
            System.out.println((int) Math.pow(number, 2) + " is not the reverse of " + (int) Math.pow(reverse, 2));
            System.out.println(number + " is not a Special Integer");
        }
    }
}