Opening Hours :7AM to 9PM
import java.util.Scanner; class EmirpNumber { public boolean isPrime(int n) { if (n < 2) return false; for (int i = 2; i <= Math.sqrt(n); i++) { if (n % i == 0) { return false; } } return true; } public int reverse(int n) { int rev = 0; while (n > 0) { int digit = n % 10; rev = rev * 10 + digit; n /= 10; } return rev; } public boolean isEmirp(int n) { if (!isPrime(n)) return false; int rev = reverse(n); return isPrime(rev) && rev != n; } } public class Main { public static void main(String[] args) { EmirpNumber en=new EmirpNumber(); Scanner scan = new Scanner(System.in); System.out.println("Enter a number to check if it's an emirp number:"); int num = scan.nextInt(); if (en.isEmirp(num)) { System.out.println(num + " is an emirp number"); } else { System.out.println(num + " is not an emirp number"); } } }In this code, isPrime(n) method checks if the number is prime or not, reverse(n) method returns the reverse of given number and the isEmirp(n) checks whether the number is emirp or not.