number theory Calculators

GCD Calculator

Calculate the Greatest Common Divisor of two numbers

Calculate the Least Common Multiple of two numbers

Check if a number is prime

Calculate the factorial of a number

Calculate the nth Fibonacci number

Calculate (a + b) mod m, (a - b) mod m, and (a * b) mod m

Check if a number is a perfect number

Calculate Euler's totient function φ(n)

Count the number of divisors of a given number

Convert binary numbers to decimal

Find all prime factors of any integer and display the complete factorization

Calculate Greatest Common Divisor and Least Common Multiple of multiple numbers

Perform modular arithmetic operations including addition, multiplication, and exponentiation

Generate Fibonacci numbers and analyze sequence properties

Check if numbers are perfect, abundant, or deficient and find their divisor sums

Explore the Collatz sequence (3n+1 problem) and analyze convergence patterns

Calculate Euler's totient function φ(n) and find coprime integers

Solve systems of modular congruences using the Chinese Remainder Theorem

Determine quadratic residues and non-residues modulo prime numbers

Analyze gaps between consecutive prime numbers and identify prime patterns