Divisors of 56862: All 32 Factors

Quick Answer

56862 has 32 divisors (factors): 1, 2, 3, 6, 9, 13, 18, 26, 27, 39, 54, 78, 81, 117, 162, 234, 243, 351, 486, 702, 729, 1053, 1458, 2106, 2187, 3159, 4374, 6318, 9477, 18954, 28431, 56862.

Sum: 137760.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 6, 9, 13, 18, 26, 27, 39, 54, 78, 81, 117, 162, 234, 243, 351, 486, 702, 729, 1053, 1458, 2106, 2187, 3159, 4374, 6318, 9477, 18954, 28431, 56862

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 56862

The number 56862 has 32 divisors:

1,  2,  3,  6,  9,  13,  18,  26,  27,  39,  54,  78,  81,  117,  162,  234,  243,  351,  486,  702,  729,  1053,  1458,  2106,  2187,  3159,  4374,  6318,  9477,  18954,  28431,  56862

Divisor Pairs of 56862

Each pair multiplies to 56862:

Factor 1×Factor 2=Product
1×56862=56862
2×28431=56862
3×18954=56862
6×9477=56862
9×6318=56862
13×4374=56862
18×3159=56862
26×2187=56862
27×2106=56862
39×1458=56862
54×1053=56862
78×729=56862
81×702=56862
117×486=56862
162×351=56862
234×243=56862

Number of Divisors

The number 56862 has 32 divisors, written as τ(56862) = 32 in number theory.

Sum of Divisors

σ(56862) = 1 + 2 + 3 + 6 + 9 + 13 + 18 + 26 + 27 + 39 + 54 + 78 + 81 + 117 + 162 + 234 + 243 + 351 + 486 + 702 + 729 + 1053 + 1458 + 2106 + 2187 + 3159 + 4374 + 6318 + 9477 + 18954 + 28431 + 56862 = 137760

Properties of 56862

  • 56862 is composite.
  • 56862 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 137760.

Common Divisors with Another Number?

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

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

  1. 1 divides 56862 (56862 ÷ 1 = 56862) → pair (1, 56862)
  2. 2 divides 56862 (56862 ÷ 2 = 28431) → pair (2, 28431)
  3. 3 divides 56862 (56862 ÷ 3 = 18954) → pair (3, 18954)
  4. 6 divides 56862 (56862 ÷ 6 = 9477) → pair (6, 9477)
  5. 9 divides 56862 (56862 ÷ 9 = 6318) → pair (9, 6318)
  6. 13 divides 56862 (56862 ÷ 13 = 4374) → pair (13, 4374)
  7. 18 divides 56862 (56862 ÷ 18 = 3159) → pair (18, 3159)
  8. 26 divides 56862 (56862 ÷ 26 = 2187) → pair (26, 2187)
  9. 27 divides 56862 (56862 ÷ 27 = 2106) → pair (27, 2106)
  10. 39 divides 56862 (56862 ÷ 39 = 1458) → pair (39, 1458)
  11. 54 divides 56862 (56862 ÷ 54 = 1053) → pair (54, 1053)
  12. 78 divides 56862 (56862 ÷ 78 = 729) → pair (78, 729)
  13. 81 divides 56862 (56862 ÷ 81 = 702) → pair (81, 702)
  14. 117 divides 56862 (56862 ÷ 117 = 486) → pair (117, 486)
  15. 162 divides 56862 (56862 ÷ 162 = 351) → pair (162, 351)
  16. 234 divides 56862 (56862 ÷ 234 = 243) → pair (234, 243)
  17. Collect all unique values: {1, 2, 3, 6, 9, 13, 18, 26, 27, 39, 54, 78, 81, 117, 162, 234, 243, 351, 486, 702, 729, 1053, 1458, 2106, 2187, 3159, 4374, 6318, 9477, 18954, 28431, 56862} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 6 + 9 + 13 + 18 + 26 + 27 + 39 + 54 + 78 + 81 + 117 + 162 + 234 + 243 + 351 + 486 + 702 + 729 + 1053 + 1458 + 2106 + 2187 + 3159 + 4374 + 6318 + 9477 + 18954 + 28431 + 56862 = 137760.

Nearby Examples

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

Related Operations for 56862

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