Divisors of 50694: All 32 Factors

Quick Answer

50694 has 32 divisors (factors): 1, 2, 3, 6, 7, 14, 17, 21, 34, 42, 51, 71, 102, 119, 142, 213, 238, 357, 426, 497, 714, 994, 1207, 1491, 2414, 2982, 3621, 7242, 8449, 16898, 25347, 50694.

Sum: 124416.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 6, 7, 14, 17, 21, 34, 42, 51, 71, 102, 119, 142, 213, 238, 357, 426, 497, 714, 994, 1207, 1491, 2414, 2982, 3621, 7242, 8449, 16898, 25347, 50694

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 50694

The number 50694 has 32 divisors:

1,  2,  3,  6,  7,  14,  17,  21,  34,  42,  51,  71,  102,  119,  142,  213,  238,  357,  426,  497,  714,  994,  1207,  1491,  2414,  2982,  3621,  7242,  8449,  16898,  25347,  50694

Divisor Pairs of 50694

Each pair multiplies to 50694:

Factor 1×Factor 2=Product
1×50694=50694
2×25347=50694
3×16898=50694
6×8449=50694
7×7242=50694
14×3621=50694
17×2982=50694
21×2414=50694
34×1491=50694
42×1207=50694
51×994=50694
71×714=50694
102×497=50694
119×426=50694
142×357=50694
213×238=50694

Number of Divisors

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

Sum of Divisors

σ(50694) = 1 + 2 + 3 + 6 + 7 + 14 + 17 + 21 + 34 + 42 + 51 + 71 + 102 + 119 + 142 + 213 + 238 + 357 + 426 + 497 + 714 + 994 + 1207 + 1491 + 2414 + 2982 + 3621 + 7242 + 8449 + 16898 + 25347 + 50694 = 124416

Properties of 50694

  • 50694 is composite.
  • 50694 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 124416.

Common Divisors with Another Number?

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

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

  1. 1 divides 50694 (50694 ÷ 1 = 50694) → pair (1, 50694)
  2. 2 divides 50694 (50694 ÷ 2 = 25347) → pair (2, 25347)
  3. 3 divides 50694 (50694 ÷ 3 = 16898) → pair (3, 16898)
  4. 6 divides 50694 (50694 ÷ 6 = 8449) → pair (6, 8449)
  5. 7 divides 50694 (50694 ÷ 7 = 7242) → pair (7, 7242)
  6. 14 divides 50694 (50694 ÷ 14 = 3621) → pair (14, 3621)
  7. 17 divides 50694 (50694 ÷ 17 = 2982) → pair (17, 2982)
  8. 21 divides 50694 (50694 ÷ 21 = 2414) → pair (21, 2414)
  9. 34 divides 50694 (50694 ÷ 34 = 1491) → pair (34, 1491)
  10. 42 divides 50694 (50694 ÷ 42 = 1207) → pair (42, 1207)
  11. 51 divides 50694 (50694 ÷ 51 = 994) → pair (51, 994)
  12. 71 divides 50694 (50694 ÷ 71 = 714) → pair (71, 714)
  13. 102 divides 50694 (50694 ÷ 102 = 497) → pair (102, 497)
  14. 119 divides 50694 (50694 ÷ 119 = 426) → pair (119, 426)
  15. 142 divides 50694 (50694 ÷ 142 = 357) → pair (142, 357)
  16. 213 divides 50694 (50694 ÷ 213 = 238) → pair (213, 238)
  17. Collect all unique values: {1, 2, 3, 6, 7, 14, 17, 21, 34, 42, 51, 71, 102, 119, 142, 213, 238, 357, 426, 497, 714, 994, 1207, 1491, 2414, 2982, 3621, 7242, 8449, 16898, 25347, 50694} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 6 + 7 + 14 + 17 + 21 + 34 + 42 + 51 + 71 + 102 + 119 + 142 + 213 + 238 + 357 + 426 + 497 + 714 + 994 + 1207 + 1491 + 2414 + 2982 + 3621 + 7242 + 8449 + 16898 + 25347 + 50694 = 124416.

Nearby Examples

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

Related Operations for 50694

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