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");