Automorphic Numbers using Recursive Method

Write a program to allow the user to enter a positive integer.

Now check if the entered number is an automorphic number or not, using a recursive method.

An automorphic number is one whose square ends with the original number itself.

Example:
INPUT: 25
OUTPUT: 25 is automorphic.

A recursive method is one that calls itself either directly or indirectly.

import java.io.*;
class Automorphic{
    public static void main(String args[])throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        System.out.print("Enter the number: ");
        int num = Math.abs(Integer.parseInt(br.readLine()));
        if(isAutomorphic(num, 10))
            System.out.println(num + " is automorphic.");
        else
            System.out.println(num + " is not automorphic.");
    }
    public static boolean isAutomorphic(int num, int p){
        if(p > num * num)
            return false;
        else if((num * num) % p == num)
            return true;
        else
            return isAutomorphic(num, p * 10);

    }
}