Divisors of 1386: All 24 Factors
Quick Answer
1386 has 24 divisors (factors): 1, 2, 3, 6, 7, 9, 11, 14, 18, 21, 22, 33, 42, 63, 66, 77, 99, 126, 154, 198, 231, 462, 693, 1386.
Sum: 3744.
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 1386
The number 1386 has 24 divisors:
1, 2, 3, 6, 7, 9, 11, 14, 18, 21, 22, 33, 42, 63, 66, 77, 99, 126, 154, 198, 231, 462, 693, 1386
Divisor Pairs of 1386
Each pair multiplies to 1386:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 1386 | = | 1386 |
| 2 | × | 693 | = | 1386 |
| 3 | × | 462 | = | 1386 |
| 6 | × | 231 | = | 1386 |
| 7 | × | 198 | = | 1386 |
| 9 | × | 154 | = | 1386 |
| 11 | × | 126 | = | 1386 |
| 14 | × | 99 | = | 1386 |
| 18 | × | 77 | = | 1386 |
| 21 | × | 66 | = | 1386 |
| 22 | × | 63 | = | 1386 |
| 33 | × | 42 | = | 1386 |
Number of Divisors
The number 1386 has 24 divisors, written as τ(1386) = 24 in number theory.
Sum of Divisors
σ(1386) = 1 + 2 + 3 + 6 + 7 + 9 + 11 + 14 + 18 + 21 + 22 + 33 + 42 + 63 + 66 + 77 + 99 + 126 + 154 + 198 + 231 + 462 + 693 + 1386 = 3744
Prime Factorization of 1386
Properties of 1386
- 1386 is composite.
- 1386 is not a perfect square.
- Number of divisors: 24.
- Sum of divisors: 3744.
Common Divisors with Another Number?
Looking for the divisors that 1386 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 1386
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √1386 ≈ 37.23. If i divides 1386, then both i and 1386/i are divisors.
- 1 divides 1386 (1386 ÷ 1 = 1386) → pair (1, 1386)
- 2 divides 1386 (1386 ÷ 2 = 693) → pair (2, 693)
- 3 divides 1386 (1386 ÷ 3 = 462) → pair (3, 462)
- 6 divides 1386 (1386 ÷ 6 = 231) → pair (6, 231)
- 7 divides 1386 (1386 ÷ 7 = 198) → pair (7, 198)
- 9 divides 1386 (1386 ÷ 9 = 154) → pair (9, 154)
- 11 divides 1386 (1386 ÷ 11 = 126) → pair (11, 126)
- 14 divides 1386 (1386 ÷ 14 = 99) → pair (14, 99)
- 18 divides 1386 (1386 ÷ 18 = 77) → pair (18, 77)
- 21 divides 1386 (1386 ÷ 21 = 66) → pair (21, 66)
- 22 divides 1386 (1386 ÷ 22 = 63) → pair (22, 63)
- 33 divides 1386 (1386 ÷ 33 = 42) → pair (33, 42)
- Collect all unique values: {1, 2, 3, 6, 7, 9, 11, 14, 18, 21, 22, 33, 42, 63, 66, 77, 99, 126, 154, 198, 231, 462, 693, 1386} — total 24 divisors.
- Sum: 1 + 2 + 3 + 6 + 7 + 9 + 11 + 14 + 18 + 21 + 22 + 33 + 42 + 63 + 66 + 77 + 99 + 126 + 154 + 198 + 231 + 462 + 693 + 1386 = 3744.
Nearby Examples
Related Operations for 1386
- Multiples of 1386 — "outward" complement; M is a multiple of 1386 ⇔ 1386 is a divisor of M
- 1386 Prime Factorization — decompose into prime building blocks
- Find GCF of 1386 and another number
- Find LCM of 1386 and another number
- Is 1386 a perfect square? (odd divisor count ⇔ yes)
See also our tables of divisors:
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
- Multiples of a Number — "outward" complement
- Prime Factorization — product of prime divisors
- Greatest Common Factor (GCF) — largest common divisor of 2+ numbers
- Least Common Multiple (LCM) — smallest common multiple
- Is N a Perfect Square? — odd divisor count check