Prime Factorizer
Check whether a number is prime, get its prime factorization (like 2³ × 3² × 5), and count its divisors—up to 10¹². Everything runs in your browser.
Enter an integer between 2 and 10¹²
FAQ
How is the divisor count computed?
If n = p^a × q^b, the count is (a+1)(b+1). For 360 = 2³×3²×5, that's 4×3×2 = 24 divisors.
Why isn't 1 prime?
Primes have exactly two divisors. Including 1 would break the uniqueness of prime factorization.
How large can the input be?
Up to 10¹² via trial division—larger inputs would be slow. Cryptographic-scale factoring needs specialized tools.
Related tools
Compute the greatest common divisor and least common multiple of two or more positive integers using the Euclidean algorithm. Everything runs in your browser.
Convert numbers between binary, octal, decimal, and hexadecimal. Handles very large integers exactly, all in your browser.
Generate random numbers in any range, with unique-draw and sorting options—handy for raffles and lottery picks. Everything runs in your browser.
Calculate your exact age from a birth date, with years/months/days and total days. The reference date is adjustable, and everything runs in your browser.
Compute the winter wind-chill (feels-like) temperature from air temperature and wind speed using the JAG/TI formula, with m/s and km/h support. Everything runs in your browser.
Get the aspect ratio (like 16:9) from a width and height, and compute new sizes that keep the ratio—handy for video and image resizing. Everything runs in your browser.