Code Below:


import java.util.*;
public class truncableprime
{
    int n;
    void input()
    {
        Scanner s =new Scanner(System.in);
        System.out.println("Enter a number");
        n=s.nextInt();
    }
    boolean checkPrime(int h)
    {
        int i,x=h,c=0;
        if (x==1)
        return false;
        for (i=2;i< x;i++)
        {
            if (x%i==0)
            c++;
        }
        if (c>0)
        return false;
        else
        return true;
    }
    void checkNum()
    {
        truncableprime obj=new truncableprime();
        boolean d=false;int a=n; int k=0;
        while(a>0)
        {
            d=obj.checkPrime(a);
            if (d==true)
            a=a/10;
            else
            {
                k=k+1;
                break;
            }
        }
        if(k==0)
        System.out.println(n+"is a right truncatabale prime");
        else
        System.out.println(n+"is not a right truncatable prime");
    }
}