Number Calculators | HowManyNumbers.com

How Many Numbers Go Into

Calculate how many times one number goes into another number (division with quotient and remainder).

Formula: Quotient = floor(dividend ÷ divisor), Remainder = dividend mod divisor

Input	Output
How many 23s go into 99?	4 times with remainder 7
How many 5s go into 47?	9 times with remainder 2
How many 12s go into 144?	12 times with remainder 0

Try other division calculations:

How Many Numbers Between

Calculate how many numbers exist between any two given numbers, with options to include or exclude the boundary numbers.

Formula: Count = |end - start| + 1 (inclusive) or |end - start| - 1 (exclusive)

Input	Output (Inclusive)	Output (Exclusive)
5 to 59	55 numbers	53 numbers
10 to 20	11 numbers	9 numbers
1 to 100	100 numbers	98 numbers

Try counting numbers in other ranges:

Factorial Calculation

The factorial of a number is the product of all positive integers from 1 up to that number. It is commonly used in permutations, combinations, and probability calculations.

Formula: n! = n × (n - 1) × (n - 2) × ... × 1

Input	Output
3	6
5	120
7	5040

Try other factorial calculations:

Prime Number Check

Check if a number is prime or composite instantly.

Formula: A prime number is a number greater than 1 that has no positive divisors other than 1 and itself.

Input	Output
11	Prime
12	Not prime
29	Prime

Try other prime number checks:

Palindrome Number Check

Determine if a number reads the same backward and forward.

Formula: A palindrome number remains the same when its digits are reversed.

Input	Output
121	Palindrome
123	Not palindrome
4554	Palindrome

Try other palindrome checks:

Fibonacci Sequence Up To Number

Generate Fibonacci numbers up to any limit.

Formula: Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, ... where each number is the sum of the two preceding ones.

Input	Output
10	0, 1, 1, 2, 3, 5, 8
20	0, 1, 1, 2, 3, 5, 8, 13
30	0, 1, 1, 2, 3, 5, 8, 13, 21

Try other Fibonacci sequences:

Sum of Digits

Calculate the sum of all digits in any number.

Formula: Sum of digits = digit1 + digit2 + digit3 + ...

Input	Output
1234	10
98765	35
11111	5

Try other digit sum calculations:

Number Comparison

Compare two numbers to find which is larger and calculate their difference easily.

Formula: Difference = |number1 - number2|

Input	Output
123 & 456	456 is larger, difference 333
500 & 300	500 is larger, difference 200
700 & 700	Numbers are equal

Try other number comparisons:

Count Divisors

Count the total number of divisors (factors) of any given number.

Formula: Divisors are positive integers that divide the number evenly without remainder.

Input	Output
12	6 divisors (1, 2, 3, 4, 6, 12)
60	12 divisors
17	2 divisors (1, 17)

Try counting divisors for other numbers:

Is Even or Odd

Determine whether a number is even or odd instantly.

Formula: A number is even if divisible by 2 (remainder 0), odd otherwise.

Input	Output
42	Even
37	Odd
100	Even

Or

Try checking other numbers:

Number Properties Summary

Get a comprehensive overview of various mathematical properties of any number including prime status, even/odd, palindrome check, and more.

Properties checked: Prime, Even/Odd, Palindrome, Perfect Number, Digit Count, Sum of Digits, and Divisor Count.

Input	Sample Properties
28	Even, Not Prime, Perfect Number, 2 digits
121	Odd, Not Prime, Palindrome, 3 digits
17	Odd, Prime, Not Palindrome, 2 digits

Try analyzing properties of other numbers:

Greatest Common Divisor (GCD)

Calculate the greatest common divisor (GCD) of two numbers using the Euclidean algorithm.

Formula: GCD(a, b) = GCD(b, a mod b) until b = 0

Input	Output
36 & 48	12
54 & 24	6
17 & 13	1

Try other GCD calculations:

Least Common Multiple (LCM)

Calculate the least common multiple (LCM) of two numbers.

Formula: LCM(a, b) = (a × b) / GCD(a, b)

Input	Output
12 & 15	60
8 & 12	24
7 & 21	21

Try other LCM calculations:

Number Factorization

Find all prime factors of a number and express it as a product of prime numbers.

Formula: Every integer > 1 can be expressed as a unique product of prime numbers.

Input	Prime Factorization
84	2² × 3 × 7
60	² × 3 × 5
45	3² × 5

Try factorizing other numbers:

Number Digit Count

Count the total number of digits in any given number.

Formula: Digit count = floor(log(n)) + 1 for positive numbers

Input	Digit Count
12345	5 digits
999	3 digits
1000000	7 digits

Try counting digits in other numbers:

Is Perfect Number

Check if a number is perfect - a positive integer that equals the sum of its proper positive divisors.

Formula: A perfect number equals the sum of all its positive divisors except itself.

Input	Result
28	Perfect (1+2+4+7+14=28)
6	Perfect (1+2+3=6)
12	Not perfect

Try checking other perfect numbers:

Random Number Generator

Generate a random number within any specified range with customizable minimum and maximum values.

Formula: Random number = min + (random() × (max - min + 1))

Range	Sample Output
1 to 100	42
1 to 10	7
50 to 150	127