Strong,Perfect,Neon Number Programs

Strong Number A Strong Number is a number in which the sum of the factorials of its digits is equal to the number itself. Take each digit → find factorial → add them → if result = original number, it is a Strong Number. Example Digits: 1, 4, 5 1! = 1 4! = 24 5! = 120 Sum = 1 + 24 + 120 = 145 java public class Strong { public static void main(String[] args) { int no=145; if(num(no)) { System.out.println(no +"is strong number"); } else { System.out.println(no +" is not strong number"); } } static boolean num(int no) { int temp=no; int sum=0; while(no>0) { int digit=no%10; int i=1; int fact=1; while(i<=digit) { fact*=i; i++; } sum+=fact; no=no/10; } return sum==temp; }} output Perfect Number A Perfect Number is a number whose sum of its proper divisors (excluding the number itself) is equal to the number. Add all divisors (except the number) → if result = original number → it's a Perfect Number. Example Divisors of 6: 1, 2, 3 Sum = 1 + 2 + 3 = 6 java public class Perfect { public st