Emirp Number in Java

In this section, we will learn what is an emirp number and also create Java programs to check if the given number is emirp or not. The emirp number Java program frequently asked in Java coding tests to check the logic of the programmer.

Emirp Number

A number is called an emirp number if we get another prime number on reversing the number itself. In other words, an emirp number is a number that is prime forwards or backward. It is also known as twisted prime numbers.

Note: Palindrome primes are excluded.

Emirp Number Example

Suppose, we want to check the number 79 is emirp or not.

We know that 79 is a prime number means that divisible by 1 and self only. On reversing the number, we get 97 which is another prime number. Therefore, 79 and 97 both are prime numbers. Hence, 79 is a prime number. Similarly, we can check other numbers also.

Some other emirp numbers are 13, 199, 107, 113, 1399, 1583, 1201, 3049, etc.

Steps to find Emirp Number

1. Read or initialize a number (n).
2. First, check the given number (n) is prime or not.
   • If not, break the execution and exit.
   • If prime, find the reverse (r) of the given number (n).
3. Check the reverse number (r) is prime or not.
   • If not, print number (n) is not emirp.
   • If prime, print the given number (n) as an emirp number.

Let's implement the above logic in a Java program.

Emirp Number Java Program

EmirpNumberExample1.java

Output 1:

Enter a number to check: 1399
Yes, the given number is an emirp number.

Output 2:

Enter a number to check: 14
No, the given number is an emirp number.