Strong Number Program

2. Strong Number Program:
Java Script Program:

function factorial(n) {
    if (n == 1 || n == 0) {
        return 1;
    }
    return n * factorial(n - 1);
}

function strong(num) {
    let numc = num;
    let sum = 0;

    while (numc > 0) {
        sum = sum + factorial(numc % 10);
        numc = Math.floor(numc / 10);
    }

    if (sum == num) {
        return num + " is strong";
    } else {
        return num + " is not strong";
    }
}

console.log(strong(145));

Output:

Java Program:

class StrongNumber {

    static int factorial(int n) {
        if (n == 0 || n == 1)
            return 1;

        return n * factorial(n - 1);
    }

    static String strong(int num) {

        int numc = num;
        int sum = 0;

        while (numc > 0) {
            sum = sum + factorial(numc % 10);
            numc = numc / 10;
        }

        if (sum == num)
            return num + " is strong";
        else
            return num + " is not strong";
    }

    public static void main(String[] args) {
        System.out.println(strong(145));
    }
}

Python Program:

def factorial(n):
    if n==1:
        return 1
    return n*factorial(n-1)

def strong(num):
    numc=num
    sum=0
    while  numc>0:
        sum=sum+factorial(numc%10)
        numc=numc//10
    if sum==num:
        return num," is strong"
    else:
        return num," is not strong"

print(strong(145))