Write a program to check whether a number is circular number or not

  public static int  circularLeftRotation(int num) { int unitDigit = num%10;  num = num/10; int temp = 1; while(num/temp != 0)  temp*=10; return num+unitDigit*temp;  }
public boolean isPrime(int num) {       if ( num < 2 ) return false;        for (int i = 2; i <= Math.sqrt(num); i++) {            if ( num % i == 0 ) {                return false;            }        }        return true; }
public int getDigitsCount(int number) {
int length = String.valueOf(number).length();    return length; }
public boolean isCircularPrime(int number) {               int temp = number;    while(isPrime(temp) && ((temp = circularLeftRotation(temp)) != number)); if(number == temp && isPrime(number)) { return true; } else return false; }                            public static void main(String[] args) {
System.out.println(new CircularPrime().getDigitsCount(113)); System.out.println(new CircularPrime().isPrime(113)); System.out.println(new CircularPrime().isCircularPrime(113));
}
}

I'm really not sure but but i think a