A full prime number is one in which the number itself is prime and all its digits are also prime. Given a number n, check if it is Full Prime or not.
Input : 53 Output : Yes Explanation: Number 53 is prime and its digits are also prime. Input : 41 Output : No Explanation: Number 41 is prime but its digits are not prime.
The naive approach will be to check if the number is prime or not then check the digits are prime or not, but this wont be efficient enough.
The efficient method is to do the other way around as there will be very few numbers in every 1000 numbers for which we have to check if it is prime or not, rest all numbers will fail when its digits are not prime.
If we are given multiple numbers and range of numbers is small enough so that we can store them in array, we can use Sieve of Eratosthenes to answer queries fast.
- Check if a prime number can be expressed as sum of two Prime Numbers
- Check if a number is divisible by all prime divisors of another number
- Check whether N is a Dihedral Prime Number or not
- C Program to Check Whether a Number is Prime or not
- Check if a number is a Pythagorean Prime or not
- Check if a number is Quartan Prime or not
- Check whether the given number is Wagstaff prime or not
- Check if a number is Primorial Prime or not
- Check whether a number is circular prime or not
- Check a number for Permutable Prime
- Check if the first and last digit of number N is prime and their sum is less than K
- Python program to check whether a number is Prime or not
- Check if a number can be written as a sum of 'k' prime numbers
- Check if LCM of array elements is divisible by a prime number or not
- Check if the first and last digit of the smallest number forms a prime
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : jit_t