How to use the divisor count calculator
Count divisors of a whole number and test whether it is prime. Enter whole number in the field above; the number of divisors, prime?, sum of divisors are computed instantly and plotted on the chart so you can see how the answer changes.
Formula
Variables
- n — Whole number
Worked example
With whole number = 360, the calculator gives number of divisors ≈ 24; prime? ≈ No; sum of divisors ≈ 1,170.
Frequently asked questions
What is the formula for the divisor count calculation?
Number of divisors = divcount(n). Prime? = isPrime(n)?"Yes":"No". Sum of divisors = divsum(n). Here n is whole number.
What inputs do I need for the divisor count calculator?
You need whole number. Each field is pre-filled with a typical example so you can see how the result responds as you edit the numbers.
How do I use this calculator?
Type values into the input fields. Results and the chart update instantly. Use Reset to restore the example values, Copy results to paste them elsewhere, or Share to copy a link that preserves your inputs.
Is the result exact?
Calculations use standard formulas and double-precision arithmetic, then display about seven significant figures. Real-world measurements carry uncertainty, so treat results as estimates unless your inputs are exact.