Find Emirp Numbers: Prime Numbers with a Twist (C++, Java, Python)

#include <iostream>
using namespace std;

bool isPrime(int n) {
    if (n <= 1)
        return false;
    for (int i = 2; i < n; i++)
        if (n % i == 0)
            return false;
    return true;
}

bool isEmirp(int n) {
    if (isPrime(n) == false)
        return false;
    int rev = 0;
    while (n != 0) {
        int d = n % 10;
        rev = rev * 10 + d;
        n /= 10;
    }
    return isPrime(rev);
}

int main() {
    int n = 13;
    if (isEmirp(n) == true)
        cout << "Yes";
    else
        cout << "No";
}

import java.io.*;
class Emirp {
    public static boolean isPrime(int n) {
        if (n <= 1)
            return false;
        for (int i = 2; i < n; i++)
            if (n % i == 0)
                return false;
        return true;
    }
    public static boolean isEmirp(int n) {
        if (isPrime(n) == false)
            return false;
        int rev = 0;
        while (n != 0) {
            int d = n % 10;
            rev = rev * 10 + d;
            n /= 10;
        }
        return isPrime(rev);
    }
    public static void main(String args[]) throws IOException {
        int n = 13;
        if (isEmirp(n) == true)
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}

def isPrime(n):
    if n <= 1:
        return False
    for i in range(2, n):
        if n % i == 0:
            return False
    return True

def isEmirp(n):
    n = int(n)
    if isPrime(n) == False:
        return False
    rev = 0
    while n != 0:
        d = n % 10
        rev = rev * 10 + d
        n = int(n / 10)
    return isPrime(rev)

n = 13
if isEmirp(n):
    print("Yes")
else:
    print("No")

#include <cmath>
#include <iostream>
#include <string>
using namespace std;

bool is_prime(int num) {
    if (num < 2) {
        return false;
    }
    for (int i = 2; i <= sqrt(num); i++) {
        if (num % i == 0) {
            return false;
        }
    }
    return true;
}

int reverse_number(int num) {
    string str_num = to_string(num);
    string rev_str_num = "";
    for (int i = str_num.length() - 1; i >= 0; i--) {
        rev_str_num += str_num[i];
    }
    return stoi(rev_str_num);
}

string is_emirp(int num) {
    if (!is_prime(num)) {
        return "Not Emirp";
    }
    int rev_num = reverse_number(num);
    if (is_prime(rev_num) && num != rev_num) {
        return "Emirp";
    } else {
        return "Not Emirp";
    }
}

int main() {
    int num = 27;
    cout << is_emirp(num) << endl;
}

import java.lang.Math;
import java.util.Scanner;
public class Emirp {
    public static boolean isPrime(int num) {
        if (num < 2) {
            return false;
        }
        for (int i = 2; i <= Math.sqrt(num); i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
    public static int reverseNumber(int num) {
        String strNum = Integer.toString(num);
        String revStrNum = "";
        for (int i = strNum.length() - 1; i >= 0; i--) {
            revStrNum += strNum.charAt(i);
        }
        return Integer.parseInt(revStrNum);
    }
    public static String isEmirp(int num) {
        if (!isPrime(num)) {
            return "Not Emirp";
        }
        int revNum = reverseNumber(num);
        if (isPrime(revNum) && num != revNum) {
            return "Emirp";
        } else {
            return "Not Emirp";
        }
    }
    public static void main(String[] args) {
        int num = 27;
        System.out.println(isEmirp(num));
    }
}

def is_prime(num):
    if num < 2:
        return False
    for i in range(2, int(num**0.5) + 1):
        if num % i == 0:
            return False
    return True

def reverse_number(num):
    return int(str(num)[::-1])

def is_emirp(num):
    if not is_prime(num):
        return "Not Emirp"
    rev_num = reverse_number(num)
    if is_prime(rev_num) and num != rev_num:
        return "Emirp"
    else:
        return "Not Emirp"

num = 27
print(is_emirp(num))