How to use this tool
- Enter positive integer.
- Select Calculate to view the result.
- Check the method and assumptions below before using the result.
The method, explained
For each d up to sqrt(n), test whether n/d is an integer. Add d and its paired divisor n/d, counting a square-root divisor only once.
Using positive integer = 360, the result is 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 30, 36, 40, 45, 60, 72, 90, 120, 180, 360. Change these example inputs to match your task; use the method above to check each step.
Understanding your result
Prime factorization lists prime building blocks. This tool lists every positive divisor, including one, the number itself and composite divisors.
What to keep in mind
Positive integers through ten billion. This lists all positive divisors rather than only prime factors. Finite-precision arithmetic is used. Check the domain and the stated convention before using an approximation.
Common questions
How is this different from prime factorization?
Prime factorization lists prime building blocks. This tool lists every positive divisor, including one, the number itself and composite divisors.
How can I check the result?
For each d up to sqrt(n), test whether n/d is an integer. Add d and its paired divisor n/d, counting a square-root divisor only once. The worked example uses editable inputs. Calculations run on your device; no external API or account is required.
Methodology maintained by ClarityKit. How these tools are built and checked.