Prime Factorizer & SPF Sieve

Factor any integer, build a smallest-prime-factor sieve, and see the primes light up in a density grid.

Math & convertPrimesFactoringSieve

Factorise integers with a smallest-prime-factor sieve, and read off the divisor count, divisor sum, Euler totient, whether the number is squarefree, and how many primes live below the sieve bound. SIEVEFACTORISATIONTOTIENT

Integer

Sieve bound N

Integers to factorise

223092870 600851475143 2147483647 15485863 1000000

Prime factorisation

The sieve

π(N) primes below N-

Largest prime sieved-

Cells reassigned-

Build time-

Arithmetic functions of n

Divisor count τ(n)-

Sum of divisors σ(n)-

Euler totient φ(n)-

Squarefree-

Is prime-

More tools

Math & convert

Pythagorean Calculator

Hypotenuse, area, perimeter and both acute angles of a right triangle, from two legs or from a leg and the hypotenuse.

Math & convert

GCD & LCM Calculator

Greatest common divisor and lowest common multiple of two integers, with the Euclidean algorithm shown step by step and the gcd x lcm identity as a check.