Number Theory

Find the greatest common divisor and least common multiple for two to six nonzero integers, with Euclidean algorithm steps and prime factorization.

Break an integer into prime factors, see repeated factors, canonical exponent form, trial-division steps, and the total number of positive factors.

Find all positive factors of a number, factor pairs, prime factorization, factor count, sum of factors, proper factors, and number type.

Check whether a whole number is prime, composite, 0, or 1. Shows the smallest factor for composite numbers and links to full factorization.

Calculate the greatest common divisor, also called GCF or HCF, for two or more positive integers with Euclidean algorithm steps and Bezout coefficients for pairs.

Find the least common multiple for two or more positive integers with pairwise GCD steps and prime factorization.

Find all common factors for two or more positive integers, including the GCF, each number's factors, and relatively-prime checks.

Generate all prime numbers up to N with a Sieve of Eratosthenes grid, prime-count summary, and twin-prime pairs.

Calculate the Fibonacci number at a zero-based index, generate the sequence through that index, and show the running sum and golden-ratio approximation.

Break a whole number into place values, expanded form, powers of 10, and a digit-by-digit table.

Find the modular multiplicative inverse of an integer modulo m with an Extended Euclidean Algorithm check.

Calculate the sum of all positive divisors, proper divisor sum, divisor count, prime factorization, and perfect/abundant/deficient classification.

Factor multiple integers at once, compare prime exponents, and find the GCD and LCM from the minimum and maximum powers.