NEON,STRONG,AMSTRONG NUMBERS

Neon Number
Last Updated :
A neon number is a number where the sum of digits of square of the number is equal to the number. The task is to check and print neon numbers in a range.
Examples:
Input : 9
Output : Neon Number
Explanation: square is 9*9 = 81 and
sum of the digits of the square is 9.
Input :12
Output : Not a Neon Number
Explanation: square is 12*12 = 144 and
sum of the digits of the square is 9 (1
AMSTRONG NUMBER
number is a number that is equal to the sum of cubes of its digits. For example 0, 1, 153, 370, 371 and 407 are the Armstrong numbers.
Let's try to understand why 153 is an Armstrong number.
153 = (1*1*1)+(5*5*5)+(3*3*3)
where:
(1*1*1)=1
(5*5*5)=125
(3*3*3)=27
So: 1+125+27=153
Strong number
A number is called strong number if sum of the factorial of its digit is equal to number itself.
For example: 145
since
1! + 4! + 5! = 1 + 24 + 120 = 145
So, 145 is a Strong number. Now given a positive number N and you have to find the number is strong number or not .
Reffer:
https://www.geeksforgeeks.org/dsa/neon-number/
https://www.outsystems.com/forums/discussion/87853/armstrong-numbers/