Divisors of 1368: All 24 Factors
Quick Answer
1368 has 24 divisors (factors): 1, 2, 3, 4, 6, 8, 9, 12, 18, 19, 24, 36, 38, 57, 72, 76, 114, 152, 171, 228, 342, 456, 684, 1368.
Sum: 3900.
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 1368
The number 1368 has 24 divisors:
1, 2, 3, 4, 6, 8, 9, 12, 18, 19, 24, 36, 38, 57, 72, 76, 114, 152, 171, 228, 342, 456, 684, 1368
Divisor Pairs of 1368
Each pair multiplies to 1368:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 1368 | = | 1368 |
| 2 | × | 684 | = | 1368 |
| 3 | × | 456 | = | 1368 |
| 4 | × | 342 | = | 1368 |
| 6 | × | 228 | = | 1368 |
| 8 | × | 171 | = | 1368 |
| 9 | × | 152 | = | 1368 |
| 12 | × | 114 | = | 1368 |
| 18 | × | 76 | = | 1368 |
| 19 | × | 72 | = | 1368 |
| 24 | × | 57 | = | 1368 |
| 36 | × | 38 | = | 1368 |
Number of Divisors
The number 1368 has 24 divisors, written as τ(1368) = 24 in number theory.
Sum of Divisors
σ(1368) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 18 + 19 + 24 + 36 + 38 + 57 + 72 + 76 + 114 + 152 + 171 + 228 + 342 + 456 + 684 + 1368 = 3900
Prime Factorization of 1368
Properties of 1368
- 1368 is composite.
- 1368 is not a perfect square.
- Number of divisors: 24.
- Sum of divisors: 3900.
Common Divisors with Another Number?
Looking for the divisors that 1368 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 1368
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √1368 ≈ 36.99. If i divides 1368, then both i and 1368/i are divisors.
- 1 divides 1368 (1368 ÷ 1 = 1368) → pair (1, 1368)
- 2 divides 1368 (1368 ÷ 2 = 684) → pair (2, 684)
- 3 divides 1368 (1368 ÷ 3 = 456) → pair (3, 456)
- 4 divides 1368 (1368 ÷ 4 = 342) → pair (4, 342)
- 6 divides 1368 (1368 ÷ 6 = 228) → pair (6, 228)
- 8 divides 1368 (1368 ÷ 8 = 171) → pair (8, 171)
- 9 divides 1368 (1368 ÷ 9 = 152) → pair (9, 152)
- 12 divides 1368 (1368 ÷ 12 = 114) → pair (12, 114)
- 18 divides 1368 (1368 ÷ 18 = 76) → pair (18, 76)
- 19 divides 1368 (1368 ÷ 19 = 72) → pair (19, 72)
- 24 divides 1368 (1368 ÷ 24 = 57) → pair (24, 57)
- 36 divides 1368 (1368 ÷ 36 = 38) → pair (36, 38)
- Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 12, 18, 19, 24, 36, 38, 57, 72, 76, 114, 152, 171, 228, 342, 456, 684, 1368} — total 24 divisors.
- Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 18 + 19 + 24 + 36 + 38 + 57 + 72 + 76 + 114 + 152 + 171 + 228 + 342 + 456 + 684 + 1368 = 3900.
Nearby Examples
Related Operations for 1368
- Multiples of 1368 — "outward" complement; M is a multiple of 1368 ⇔ 1368 is a divisor of M
- 1368 Prime Factorization — decompose into prime building blocks
- Find GCF of 1368 and another number
- Find LCM of 1368 and another number
- Is 1368 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