Perfect Number Program

3. Perfect Number Program:
Java Script Program:

function divisor(n) {
    let div = 1;
    let divsum = 0;

    while (div <= n / 2) {
        if (n % div == 0) {
            divsum = divsum + div;
        }
        div++;
    }

    if (n == divsum) {
        console.log(n + " is perfect");
    } else {
        console.log(n + " is not perfect");
    }
}

divisor(6);

Output:

Java Program:

class PerfectNumber {

    static void divisor(int n) {

        int div = 1;
        int divsum = 0;

        while (div <= n / 2) {
            if (n % div == 0) {
                divsum = divsum + div;
            }
            div++;
        }

        if (n == divsum)
            System.out.println(n + " is perfect");
        else
            System.out.println(n + " is not perfect");
    }

    public static void main(String args[]) {
        divisor(6);
    }
}

Python Program:

def divisor(n):
    div=1
    divsum=0
    while div<=n/2:
        if n%div==0:
            divsum=divsum+div
        div+=1
    if n==divsum:
        print(n," is perfect")
    else:
        print(n," is not perfect")
divisor(6)