Factor Finder
Find all factors of any integer
Input: Any integer
Output: The integer's factors
Factors
Prime Factorization
Analyze an integer into a product of its prime factors. Numbers too big may take longer to calculate on low-end devices. Inputting a negative number crashes the page.
Input: Any integer
Output: The integer's prime factors.
Product of Prime Factors
Factorial Calculator
The factorial n! is equal to n multiplied by every number that precedes it. Alternatively, in mathematical terms, n! is equal to n(n-1)
Input: Any integer (n)
Output: n(n-1)
Factorial n!
Least Common Multiple
The least common multiple is defined as the smallest non-zero multiple that two or more numbers have in common.
Input: Multiple integers separated by a space i.e 15 83 31
Output: The least common multiple of the numbers
Least Common Multiple
Arithmetic Progressions
An arithmetic progression is a sequence of numbers where each successive term is equal to the preceding term plus a fixed number (d). The first number in this list is defined as a₁. An example of an arithmetic progression is: 2, 5, 8, 11, 14, 17... where a₁ = 2 and d = 3
an calculator
The n-th number of an arithmetic progression (or an) can be found using the following formula:
an = a₁ + (n-1) × d
Input:
a₁ - First term in the progression
d - Number added with each term
n - Index of an
an of progression
Sn calculator
The sum of an arithmetic progression (or Sn) is called arithmetic series and it's the sum of all the progression's terms up to an. It can be calculated using the following formula:
Sn = n × (2 × a1 + (n - 1) × d) ÷ 2
Input:
a₁ - First term in the progression
d - Number added with each term
n - Index of an
Sn of series