---
# System prepended metadata

title: 'The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.'

---

#  The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.
# Write a program to detect if a given number is a circular prime number.

// Write Algorithm Here
1. bool circulercheck(int n){
int count = 0,temp=n;
while(temp){
count ++;
temp = temp/10;
}
int num = n;
while(num){
int rem=num%10;
int num= num/10;
num= (pow(10,count-1))*rem + div;
if(num=n)
return true;
}
return false;
} 
2. 
3. 

// Write Code Here


