Twisted Prime Number - Summary, Program and Check

A number is said to be a Twisted Prime Number if its reverse is also a prime number. As for Example: 2, 11, 101, 107, 113, 149, 151 etc are Twisted Prime Numbers.
As for example let us consider about number 107. 107 is a Prime Number and its reverse 701 too is also a prime number.

CHECK FOR TWISTED PRIME NUMBER:
Now let us consider to check whether a given number is Twisted prime or Not. For this we have to do the following steps of algorithm.

FUNCTIONS USED:
check_prime(number) : Check whether "number" is prime or not. This function returns 1, if "number" is prime.
reverse(number): for reversing "number". This function returns the reverse of "number".
 
ALGORITHMS:
main( )
{
   input: number1, number2;
   number2 = reverse(number1);
   if(check_prime(number1))
   {
        if(check_prime(number2))
        {
             Print: "Twisted Prime Number";
        }
       else
        {
             Print: "Not a Twisted Prime Number";
        }
   }
   else
   {
       Print: "Not a Prime Number";
   }
}

PROGRAM:
#include<stdio.h>
int check_prime(int);
int reverse(int);
void main()
{
  int number1, number2;
  //printf("Enter a Number");
  scanf("%d", &number1);
  number2=reverse(number1);
  if(check_prime(number1))
   {
     if(check_prime(number2))
      {
        printf("\n%d is a Twisted Prime Number", number1);
      }
     else
      {
        printf("\n%d is a Twisted Prime Number", number1);
      }
   }
  else
   {
     printf("\n%d is not a Prime Number", number1);
   }
}

int reverse(int K)
{
  int i, s=0;
  while(K!=0)
   {
    i=K%10;
    s=s*10+i;
    K=K/10;
   }
  return s;
}

int check_prime(int Q)
{
  int x=1, c=0;
  while(x<=Q)
  {
    if(Q%x==0)
    {
      c=c+1;
    }
    x=x+1;
  }
  if(c==2)
  {
    return 1;
  }
  else
  {
    return 0;
  }
}

RUN PROGRAM