Divisors of 30150: All 36 Factors

Divisors (Factors) Calculator

Use the calculator above to find all divisors (also called factors) of any positive integer up to 4,782,969. Beyond the divisor list, this tool also shows divisor pairs, the sum and count of divisors, prime factorization, and number properties (prime, perfect square, perfect number).

All Divisors of 30150

The number 30150 has 36 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  25,  30,  45,  50,  67,  75,  90,  134,  150,  201,  225,  335,  402,  450,  603,  670,  1005,  1206,  1675,  2010,  3015,  3350,  5025,  6030,  10050,  15075,  30150

Divisor Pairs of 30150

Each pair multiplies to 30150:

Number of Divisors

The number 30150 has 36 divisors, written as τ(30150) = 36 in number theory.

Sum of Divisors

σ(30150) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 25 + 30 + 45 + 50 + 67 + 75 + 90 + 134 + 150 + 201 + 225 + 335 + 402 + 450 + 603 + 670 + 1005 + 1206 + 1675 + 2010 + 3015 + 3350 + 5025 + 6030 + 10050 + 15075 + 30150 = 82212

Prime Factorization of 30150

See the full prime factorization calculator →

Properties of 30150

• 30150 is composite.
• 30150 is not a perfect square.
• Number of divisors: 36.
• Sum of divisors: 82212.

Common Divisors with Another Number?

Looking for the divisors that 30150 shares with another number? Use our Greatest Common Factor (GCF) calculator — it finds all common divisors and the largest one.

Step-by-Step: How to Find the Divisors of 30150

An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √30150 ≈ 173.64. If i divides 30150, then both i and 30150/i are divisors.

1. 1 divides 30150 (30150 ÷ 1 = 30150) → pair (1, 30150)
2. 2 divides 30150 (30150 ÷ 2 = 15075) → pair (2, 15075)
3. 3 divides 30150 (30150 ÷ 3 = 10050) → pair (3, 10050)
4. 5 divides 30150 (30150 ÷ 5 = 6030) → pair (5, 6030)
5. 6 divides 30150 (30150 ÷ 6 = 5025) → pair (6, 5025)
6. 9 divides 30150 (30150 ÷ 9 = 3350) → pair (9, 3350)
7. 10 divides 30150 (30150 ÷ 10 = 3015) → pair (10, 3015)
8. 15 divides 30150 (30150 ÷ 15 = 2010) → pair (15, 2010)
9. 18 divides 30150 (30150 ÷ 18 = 1675) → pair (18, 1675)
10. 25 divides 30150 (30150 ÷ 25 = 1206) → pair (25, 1206)
11. 30 divides 30150 (30150 ÷ 30 = 1005) → pair (30, 1005)
12. 45 divides 30150 (30150 ÷ 45 = 670) → pair (45, 670)
13. 50 divides 30150 (30150 ÷ 50 = 603) → pair (50, 603)
14. 67 divides 30150 (30150 ÷ 67 = 450) → pair (67, 450)
15. 75 divides 30150 (30150 ÷ 75 = 402) → pair (75, 402)
16. 90 divides 30150 (30150 ÷ 90 = 335) → pair (90, 335)
17. 134 divides 30150 (30150 ÷ 134 = 225) → pair (134, 225)
18. 150 divides 30150 (30150 ÷ 150 = 201) → pair (150, 201)
19. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 30, 45, 50, 67, 75, 90, 134, 150, 201, 225, 335, 402, 450, 603, 670, 1005, 1206, 1675, 2010, 3015, 3350, 5025, 6030, 10050, 15075, 30150} — total 36 divisors.
20. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 25 + 30 + 45 + 50 + 67 + 75 + 90 + 134 + 150 + 201 + 225 + 335 + 402 + 450 + 603 + 670 + 1005 + 1206 + 1675 + 2010 + 3015 + 3350 + 5025 + 6030 + 10050 + 15075 + 30150 = 82212.

Nearby Examples

Related Operations for 30150

• Multiples of a Number — "outward" complement of divisors
• 30150 Prime Factorization — decompose into prime building blocks
• Find GCF of 30150 and another number
• Find LCM of 30150 and another number
• Is 30150 a perfect square? (odd divisor count ⇔ yes)

See also our tables of divisors:

• Table of all divisors from 1 to 100
• Table of all divisors from 1 to 500
• Table of all divisors from 1 to 1,000
• Table of all divisors from 1 to 10,000

What Is a Divisor?

A divisor (also called a factor) of a positive integer n is any positive integer d such that n ÷ d has no remainder. In other words, d divides n evenly.

Every positive integer n has at least two divisors: 1 and n itself (with 1 being the trivial case of having only itself). Numbers with exactly 2 divisors are prime; numbers with 3 or more divisors are composite.

Why use this calculator? Beyond just listing divisors, this tool computes the sum σ(n), the count τ(n), prime factorization, divisor pairs (useful for visual learners and factoring problems), and detects whether n is a prime, a perfect square, or a perfect number.

References

• [1] Divisor (Wikipedia)
• [2] Divisor function (Wikipedia)
• [3] Divisor (Wolfram MathWorld)

Divisors Calculation Examples

Find all divisors of these numbers: