Circular Prime number : An easy ISC practical 2016

import java.io.*;

class circular_prime
{
    static int isPrime(int x,int j)
    {
        int count=0;
        while(j<=x)
        {
            if(x%j==0)
            {
                count++;
            }
            j++;
        }
        return count;
    }

    static int checkCircular(int num)
    {
        int c=0;
        int n=num;
        String a=Integer.toString(num);
        int len=a.length();
        int b=(int)Math.pow(10,(len-1));
        for(int i=0;i<len;i++)
        {
            int rem=n%10;
            int rev=rem*b;
            int temp=rev+(n/10);
            n=temp;
            if(isPrime(temp,1)==2)
            {
                c++;
            }
        }
        if(c==len)
        {
            return 1;
        }
        else
        {
            return 0;
        }
    }

    public static void main()throws IOException
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        System.out.println("Enter a number");
        int number=Integer.parseInt(br.readLine()); if(checkCircular(number)==1) 
        {
            System.out.println("CIRCULAR PRIME NUMBER");
        }
        else
        {
            System.out.println("NOT A CIRCULAR PRIME NUMBER");
        }
    }
}