Java recursive function to check number is prime or not

Write a Java recursive function to check given number is Prime or Not.

import java.util.*;
class PrimeCheck
{
    static int c=2;
    boolean isPrime(int n)
    {
       if(c==n)
        return true;
       else
       {
           if(n%c++==0)
           return false;
           else
           return(isPrime(n));
       }
    }    
    public static void main(String arr[])
    {
        Scanner sc=new Scanner(System.in);
        System.out.println("Enter Any Number : ");
        int num=sc.nextInt();
        PrimeCheck obj=new PrimeCheck();
        boolean ans=obj.isPrime(num);
        if(ans==true)
        {
            System.out.println("Number is Prime");
        }
        else
        {
            System.out.println("Number is not a Prime");
        }
        
    }
}

Enter Any Number : 

11

Number is Prime

Enter Any Number : 

12

Number is not a Prime