How to Find Divisors and its Count in Python, Java, and JavaScript

What is a Divisor?

A divisor is a number that divides another number completely without leaving a remainder.

For example:
Divisors of 10 → 1, 2, 5, 10

Flowchart Logic

The flowchart follows these steps:

1. Start the program
2. Initialize the number (Num = 100)
3. Set divisor value (Div = 2)
4. Check if Div is less than Num
5. If true:
6. Check if Num is divisible by Div
7. If yes, print the divisor
8. Increase Div by 1
9. Repeat the process
10. Stop when condition fails

Python Code

num = 100
div = 2

while div < num:
    if num % div == 0:
        print(div)
    div = div + 1

Java Code

public class Divisors {
    public static void main(String[] args) {
        int num = 100;
        int div = 2;

        while (div < num) {
            if (num % div == 0) {
                System.out.println(div);
            }
            div = div + 1;
        }
    }
}

JavaScript Code

let num = 100;
let div = 2;

while (div < num) {
    if (num % div === 0) {
        console.log(div);
    }
    div = div + 1;
}

Output

2
4
5
10
20
25
50

Find and Count Divisors of a number

Flowchart

Flowchart Logic

1. Num = 100
2. Div = 2
3. Count = 0
4. If Num % Div == 0:
5. Print divisor
6. Count = Count + 1
7. Repeat
8. Finally print Count

Python Code

num = 100
div = 2
count = 0

while div < num:
    if num % div == 0:
        print(div)
        count += 1
    div += 1

print("Total divisors:", count)

Java Code

public class DivisorsCount {
    public static void main(String[] args) {
        int num = 100;
        int div = 2;
        int count = 0;

        while (div < num) {
            if (num % div == 0) {
                System.out.println(div);
                count++;
            }
            div++;
        }

        System.out.println("Total divisors: " + count);
    }
}

JavaScript Code

let num = 100;
let div = 2;
let count = 0;

while (div < num) {
    if (num % div === 0) {
        console.log(div);
        count++;
    }
    div++;
}

console.log("Total divisors:", count);

Output

2
4
5
10
20
25
50
Total divisors: 7