pal prime number program in java

import java.util.*;
class PalPrime
{
    public static void main(String args[])
    {
        Scanner in= new Scanner(System.in);
        int n,p,rev,s=0,i,c=0;
        System.out.println("Enter No.");
        n= in.nextInt(); // Input number from user
        p=n; // store the entered number in "p" variable
        for(i=1;i<=p;i++)
        {
            if(p%i==0)
            {
                c++;
            }
        }
        while(n>0)
        {
            rev=n%10; // extract last digit of the number
            s=s*10+rev; // store the digit last digit
            n=n/10; // extract all digit except the last
        }
        if(p==s&&c==2) // comparing with original number
        {
            System.out.println("Number is PalPrime : "+p);
        }
        else
        {
            System.out.println("Number is not PalPrime : "+p);
        }
    } // end of main method
} // end of class

Are there any code examples left?
Made with love
This website uses cookies to make IQCode work for you. By using this site, you agree to our cookie policy

Welcome Back!

Sign up to unlock all of IQCode features:
  • Test your skills and track progress
  • Engage in comprehensive interactive courses
  • Commit to daily skill-enhancing challenges
  • Solve practical, real-world issues
  • Share your insights and learnings
Create an account
Sign in
Recover lost password
Or log in with

Create a Free Account

Sign up to unlock all of IQCode features:
  • Test your skills and track progress
  • Engage in comprehensive interactive courses
  • Commit to daily skill-enhancing challenges
  • Solve practical, real-world issues
  • Share your insights and learnings
Create an account
Sign up
Or sign up with
By signing up, you agree to the Terms and Conditions and Privacy Policy. You also agree to receive product-related marketing emails from IQCode, which you can unsubscribe from at any time.
Creating a new code example
Code snippet title
Source