How does the tool find every divisor?

It uses trial division: it checks every whole number i from 1 up to the square root of your input. Whenever i divides the number evenly, both i and its complement (input ÷ i) are divisors, so both get recorded. Once every candidate up to the square root has been checked, the collected divisors are sorted in ascending order.

Why only check up to the square root?

Divisors always pair up: if i divides n, so does n ÷ i, and one of that pair is always less than or equal to √n. Checking candidates only up to √n and recording both members of each pair finds every divisor without redundant work past the square root.

Is 1 and the number itself included in the output?

Yes, every divisor is listed, including 1 and the number itself, which are divisors of every positive integer.

What's the largest number I can check?

Input is capped at 10^12 (one trillion). Trial division up to the square root of that is still fast; going much higher would make the square-root scan noticeably slow in a browser.

Divisor Finder - Find All Divisors of a Number Online

Overview

Introduction

Finding every divisor of a number by hand gets tedious fast once the number has more than a handful of factors, and it's easy to miss one.

This tool runs the full trial-division search for you and returns every positive divisor in ascending order, using BigInt arithmetic so even large inputs stay exact.

What Is Find All Divisors of a Number?

A calculator that lists every positive integer that evenly divides your input, from 1 up to the number itself.

It's the exhaustive-list companion to Prime Factor Finder, which instead reports only the number's prime factorization rather than every one of its divisors.

How Find All Divisors of a Number Works

The tool validates that the input is a whole positive integer, then converts it to a BigInt for exact arithmetic.

It loops a candidate divisor i from 1 up to the point where i × i exceeds the input, checking at each step whether the input is evenly divisible by i.

Whenever it finds a match, it records both i and the complementary divisor (input ÷ i), then sorts all the collected divisors in ascending order before joining them into the output list.

When To Use Find All Divisors of a Number

Use it whenever you need the complete divisor list of a number, for a factoring exercise, a GCD/LCM problem worked by hand, or checking whether a number is highly composite, perfect, or abundant.

For just the prime factorization instead of every divisor, use Prime Factor Finder; for a yes/no primality check, use Prime Number Checker.

Often used alongside Find Prime Factors and Test If a Number Is a Prime.

Features

Advantages

Returns the complete, exact divisor list, not just the prime factorization.
Uses BigInt arithmetic throughout, so results stay exact right up to the 10^12 input cap.

Limitations

Input is capped at 10^12 to keep the square-root trial-division scan fast in the browser.
Only accepts positive integers; 0 and negative numbers aren't valid divisor-finding inputs.

Examples

Divisors of 12

Input

Output

1, 2, 3, 4, 6, 12

1×12, 2×6, and 3×4 are the three divisor pairs that multiply to 12.

Best Practices & Notes

Best Practices

For very large inputs near the 10^12 cap, expect the calculation to take a noticeably longer moment since the square-root scan grows with the input's size.

Developer Notes

The core loop is `for (let i = 1n; i * i <= n; i += 1n)`, checking `n % i === 0n` and pushing both `i` and `n / i` (skipping the duplicate when they're equal, i.e. at a perfect square). Everything runs on BigInt rather than `Number` so a full-precision result is guaranteed all the way up to the 10^12 cap, well past where ordinary floating-point division would start introducing rounding risk in comparisons.

Find All Divisors of a Number Use Cases

Working through a factoring or GCD/LCM problem by hand and needing a quick answer key
Checking whether a number is perfect, abundant, or deficient by summing its proper divisors
Verifying a divisor-finding function in your own code against a known-good reference list

Common Mistakes

Forgetting that 1 and the number itself both count as divisors and are always included in the output list.

Tips

To find only the proper divisors (excluding the number itself), drop the last value from the output list.

Find All Divisors of a Number