A prime number is a number that has only two factors, 1 and itself. An Emirp number is a number, that when reversed, gives a prime number. Example: 13, when reversed gives 31, which is a prime number. Note: Emirp numbers are not palindromes. Palindromes are numbers, which when reversed , give the same number. Example: 131 when reversed, given 131. Hence, 131 is a palindrome. 131 is not an emirp. Algorithm Start n:=0 temp:=0 rev=0 digit:=0 i:=0 k:=0 Print "Enter a number" Read n temp=n If temp>0, go to step 12 or else go to step 16 digit=temp%10 rev=rev*10+digit temp=temp/10 Go to step 11 If step 17==true && n!=rev, then go to step 26 or else go to step 27 k=0. Go to step 18 i=2. Go to step 19 If i<n, go to step 20 or else go to step 23 If rev%i==0, go to step 21 or else go to step 22 k++. Go to step 22 i++. Go to step 19 If k==0, go to step 24 or else go to step 25 true. Go to step 17 false. Go to step 17 Print "The given number is an Emirp Number&quo