Divisors of 60912: All 50 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 60912

The number 60912 has 50 divisors:

1,  2,  3,  4,  6,  8,  9,  12,  16,  18,  24,  27,  36,  47,  48,  54,  72,  81,  94,  108,  141,  144,  162,  188,  216,  282,  324,  376,  423,  432,  564,  648,  752,  846,  1128,  1269,  1296,  1692,  2256,  2538,  3384,  3807,  5076,  6768,  7614,  10152,  15228,  20304,  30456,  60912

Divisor Pairs of 60912

Each pair multiplies to 60912:

Number of Divisors

The number 60912 has 50 divisors, written as τ(60912) = 50 in number theory.

Sum of Divisors

σ(60912) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 27 + 36 + 47 + 48 + 54 + 72 + 81 + 94 + 108 + 141 + 144 + 162 + 188 + 216 + 282 + 324 + 376 + 423 + 432 + 564 + 648 + 752 + 846 + 1128 + 1269 + 1296 + 1692 + 2256 + 2538 + 3384 + 3807 + 5076 + 6768 + 7614 + 10152 + 15228 + 20304 + 30456 + 60912 = 180048

Prime Factorization of 60912

See the full prime factorization calculator →

Properties of 60912

• 60912 is composite.
• 60912 is not a perfect square.
• Number of divisors: 50.
• Sum of divisors: 180048.

Common Divisors with Another Number?

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

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

1. 1 divides 60912 (60912 ÷ 1 = 60912) → pair (1, 60912)
2. 2 divides 60912 (60912 ÷ 2 = 30456) → pair (2, 30456)
3. 3 divides 60912 (60912 ÷ 3 = 20304) → pair (3, 20304)
4. 4 divides 60912 (60912 ÷ 4 = 15228) → pair (4, 15228)
5. 6 divides 60912 (60912 ÷ 6 = 10152) → pair (6, 10152)
6. 8 divides 60912 (60912 ÷ 8 = 7614) → pair (8, 7614)
7. 9 divides 60912 (60912 ÷ 9 = 6768) → pair (9, 6768)
8. 12 divides 60912 (60912 ÷ 12 = 5076) → pair (12, 5076)
9. 16 divides 60912 (60912 ÷ 16 = 3807) → pair (16, 3807)
10. 18 divides 60912 (60912 ÷ 18 = 3384) → pair (18, 3384)
11. 24 divides 60912 (60912 ÷ 24 = 2538) → pair (24, 2538)
12. 27 divides 60912 (60912 ÷ 27 = 2256) → pair (27, 2256)
13. 36 divides 60912 (60912 ÷ 36 = 1692) → pair (36, 1692)
14. 47 divides 60912 (60912 ÷ 47 = 1296) → pair (47, 1296)
15. 48 divides 60912 (60912 ÷ 48 = 1269) → pair (48, 1269)
16. 54 divides 60912 (60912 ÷ 54 = 1128) → pair (54, 1128)
17. 72 divides 60912 (60912 ÷ 72 = 846) → pair (72, 846)
18. 81 divides 60912 (60912 ÷ 81 = 752) → pair (81, 752)
19. 94 divides 60912 (60912 ÷ 94 = 648) → pair (94, 648)
20. 108 divides 60912 (60912 ÷ 108 = 564) → pair (108, 564)
21. 141 divides 60912 (60912 ÷ 141 = 432) → pair (141, 432)
22. 144 divides 60912 (60912 ÷ 144 = 423) → pair (144, 423)
23. 162 divides 60912 (60912 ÷ 162 = 376) → pair (162, 376)
24. 188 divides 60912 (60912 ÷ 188 = 324) → pair (188, 324)
25. 216 divides 60912 (60912 ÷ 216 = 282) → pair (216, 282)
26. Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 36, 47, 48, 54, 72, 81, 94, 108, 141, 144, 162, 188, 216, 282, 324, 376, 423, 432, 564, 648, 752, 846, 1128, 1269, 1296, 1692, 2256, 2538, 3384, 3807, 5076, 6768, 7614, 10152, 15228, 20304, 30456, 60912} — total 50 divisors.
27. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 27 + 36 + 47 + 48 + 54 + 72 + 81 + 94 + 108 + 141 + 144 + 162 + 188 + 216 + 282 + 324 + 376 + 423 + 432 + 564 + 648 + 752 + 846 + 1128 + 1269 + 1296 + 1692 + 2256 + 2538 + 3384 + 3807 + 5076 + 6768 + 7614 + 10152 + 15228 + 20304 + 30456 + 60912 = 180048.

Nearby Examples

Related Operations for 60912

• Multiples of a Number — "outward" complement of divisors
• 60912 Prime Factorization — decompose into prime building blocks
• Find GCF of 60912 and another number
• Find LCM of 60912 and another number
• Is 60912 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: