Divisors of 47100: All 36 Factors

Quick Answer

47100 has 36 divisors (factors): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 50, 60, 75, 100, 150, 157, 300, 314, 471, 628, 785, 942, 1570, 1884, 2355, 3140, 3925, 4710, 7850, 9420, 11775, 15700, 23550, 47100.

Sum: 137144.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 50, 60, 75, 100, 150, 157, 300, 314, 471, 628, 785, 942, 1570, 1884, 2355, 3140, 3925, 4710, 7850, 9420, 11775, 15700, 23550, 47100

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 47100

The number 47100 has 36 divisors:

1,  2,  3,  4,  5,  6,  10,  12,  15,  20,  25,  30,  50,  60,  75,  100,  150,  157,  300,  314,  471,  628,  785,  942,  1570,  1884,  2355,  3140,  3925,  4710,  7850,  9420,  11775,  15700,  23550,  47100

Divisor Pairs of 47100

Each pair multiplies to 47100:

Factor 1×Factor 2=Product
1×47100=47100
2×23550=47100
3×15700=47100
4×11775=47100
5×9420=47100
6×7850=47100
10×4710=47100
12×3925=47100
15×3140=47100
20×2355=47100
25×1884=47100
30×1570=47100
50×942=47100
60×785=47100
75×628=47100
100×471=47100
150×314=47100
157×300=47100

Number of Divisors

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

Sum of Divisors

σ(47100) = 1 + 2 + 3 + 4 + 5 + 6 + 10 + 12 + 15 + 20 + 25 + 30 + 50 + 60 + 75 + 100 + 150 + 157 + 300 + 314 + 471 + 628 + 785 + 942 + 1570 + 1884 + 2355 + 3140 + 3925 + 4710 + 7850 + 9420 + 11775 + 15700 + 23550 + 47100 = 137144

Properties of 47100

  • 47100 is composite.
  • 47100 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 137144.

Common Divisors with Another Number?

Looking for the divisors that 47100 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 47100

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

  1. 1 divides 47100 (47100 ÷ 1 = 47100) → pair (1, 47100)
  2. 2 divides 47100 (47100 ÷ 2 = 23550) → pair (2, 23550)
  3. 3 divides 47100 (47100 ÷ 3 = 15700) → pair (3, 15700)
  4. 4 divides 47100 (47100 ÷ 4 = 11775) → pair (4, 11775)
  5. 5 divides 47100 (47100 ÷ 5 = 9420) → pair (5, 9420)
  6. 6 divides 47100 (47100 ÷ 6 = 7850) → pair (6, 7850)
  7. 10 divides 47100 (47100 ÷ 10 = 4710) → pair (10, 4710)
  8. 12 divides 47100 (47100 ÷ 12 = 3925) → pair (12, 3925)
  9. 15 divides 47100 (47100 ÷ 15 = 3140) → pair (15, 3140)
  10. 20 divides 47100 (47100 ÷ 20 = 2355) → pair (20, 2355)
  11. 25 divides 47100 (47100 ÷ 25 = 1884) → pair (25, 1884)
  12. 30 divides 47100 (47100 ÷ 30 = 1570) → pair (30, 1570)
  13. 50 divides 47100 (47100 ÷ 50 = 942) → pair (50, 942)
  14. 60 divides 47100 (47100 ÷ 60 = 785) → pair (60, 785)
  15. 75 divides 47100 (47100 ÷ 75 = 628) → pair (75, 628)
  16. 100 divides 47100 (47100 ÷ 100 = 471) → pair (100, 471)
  17. 150 divides 47100 (47100 ÷ 150 = 314) → pair (150, 314)
  18. 157 divides 47100 (47100 ÷ 157 = 300) → pair (157, 300)
  19. Collect all unique values: {1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 50, 60, 75, 100, 150, 157, 300, 314, 471, 628, 785, 942, 1570, 1884, 2355, 3140, 3925, 4710, 7850, 9420, 11775, 15700, 23550, 47100} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 10 + 12 + 15 + 20 + 25 + 30 + 50 + 60 + 75 + 100 + 150 + 157 + 300 + 314 + 471 + 628 + 785 + 942 + 1570 + 1884 + 2355 + 3140 + 3925 + 4710 + 7850 + 9420 + 11775 + 15700 + 23550 + 47100 = 137144.

Nearby Examples

ndivisors countsum σ(n)
360241170
24020744
18018546
14415403
12016360
1009217
9012234
8412224

Related Operations for 47100

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.

Divisors Calculation Examples

Find all divisors of these numbers:

Related Calculators