Number Theory, Divisors & Number Systems Calculators

Divisibility, primes, GCD/LCM, modular arithmetic and base conversion — the toolkit for discrete-math courses, cryptography coursework and programmers working with bit-level or modular values.

8 calculators in this category

Which one do you need?

GCF / GCD Calculator
Find the greatest common factor of two, three or four integers by the Euclidean algorithm and by prime factorization, with every step shown and the LCM too.
LCM Calculator
Find the least common multiple of two, three or four integers using the GCD relation and prime factorization, with every step, the LCD and a multiples table.
Prime Factorization Calculator
Break any integer into its prime factors with exponents, and get the divisor count, sum of divisors, Euler totient and the largest prime factor.
Prime Number Checker Calculator
Test whether a number is prime, find its smallest factor and its nearest prime neighbours, and list every prime in a range you choose, with the working shown.
Factors of a Number Calculator
List every factor of a whole number with its factor pairs, and get the divisor count, the divisor sum and whether the number is perfect, abundant or deficient.
Long Division Calculator with Remainder
Divide two whole numbers and see the quotient, the remainder and the full digit-by-digit long-division layout, continued to as many decimal places as you want.
Modulo Calculator
Compute a mod n with the mathematical least non-negative convention, compare it with the programming remainder, and get modular sums, products, powers and inverses.
Base Conversion Calculator
Convert whole numbers and fractions between any two bases from 2 to 36. See the positional expansion, the repeated-division digits, and binary, octal and hex.

More arithmetic, algebra & number theory categories

Related categories in other subjects

Where this work overlaps other trades and disciplines.