PalPrime Number in JAVA

Palindromic Prime Number in JAVA

If a number is simultaneously palindromic and prime then it is said to be a PalPrime Number.

Example: Number 313, 353 etc are PalPrime number.

Algorithm and Program below :-

The video link of this program is provided at the end of this post.

ALGORITHM :-

1. Get the number to check for PalPrime Number
2. Hold the number in temporary variable
3. Using loop find if it is prime or not.
4. Check if the number is Palindrome or not.
5. If the number is both prime and palindrome print "PalPrime Number"
6. If not print "Not a PalPrime Number"

PROGRAM below :-

import java.io.*;
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

All the best :)

Watch this Program Video : https://youtu.be/iRL0v805om8

 

 

Follow me on Instagram