Circular prime isc 2016

Circular prime is a prime number that remains prime after changing its digits one by one
Eg-///input-131
  311 is a prime
  113 is a prime
So 131 is a circular prime
The program given

import java.util.*;
import java.math.*;
class circularprime
     {
     public static void main(String args[])
       {
       Scanner in=new Scanner(System.in);
      System.out.println("enter the numbers");
       int n=in.nextInt();
       int remainder,nodigit,dupn,check;
       double front,rear;
       dupn=n;
       nodigit=0;
       check=0;
       while(dupn>0)
      {
        nodigit++;
       dupn=dupn/10;
       }
        for(int i=0;i<nodigit;i++)
       {
        front=n/(Math.pow(10,nodigit-1));
       rear=n%(Math.pow(10,nodigit-1));
       n=(int)(rear*(Math.pow(10,1))+front);
       if(checkprime(n))
       check++;
       else
      {
      check=0;
      break;
      }
      }
     if(check==nodigit)
        {
         System.out.println("the number is circular           prime");
        }
        else
       System.out.println("no prime");
      }
    public static boolean checkprime(int n)
        {   int c=0;
       for(int i=1;i<=n;i++)
      if(n%i==0)
      c++;
     if(c==2)
     return true;
     else
     return false;
}
}