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