Prime Factorization of 10,009,493,929
10,009,493,929 = 223 × 44885623
Properties of 10,009,493,929
| Prime factors | 223, 44885623 |
| Distinct prime factors | 2 |
| Total number of divisors | 4 |
| Sum of divisors | 10,054,379,776 |
| Perfect square | No |
| Prime number | No |
Factorization tree
- 10,009,493,929
- 223
- 44,885,623
Factorize another number
Limit: 2 to 10¹² (1,000,000,000,000).
Enter any positive integer up to 1 trillion (10¹²) to find its unique prime factorization. You will see the canonical form (e.g. 360 = 2³ × 3² × 5), the divisor count, divisor sum, and an interactive factorization tree.
About prime factorization
What is prime factorization?
The prime factorization of an integer n ≥ 2 is the unique way to write n as a product of prime numbers. By the Fundamental Theorem of Arithmetic, every integer ≥ 2 has exactly one such representation (up to the order of factors). For example, 10,009,493,929 = 223 × 44885623.
How are the divisor count and sum computed?
If n = p₁e₁ × … × pkek, the number of divisors is τ(n) = (e₁+1)…(ek+1) and the sum of divisors is σ(n) = ∏ (1 + p + p² + … + pe) for each prime power. For 10,009,493,929 = 223 × 44885623:
τ(10,009,493,929) = 2 × 2 = 4 (1, 223, 44,885,623, 10,009,493,929)
σ(10,009,493,929) = (1 + 223) × (1 + 44885623) = 224 × 44,885,624 = 10,054,379,776
Frequently asked questions
A prime factor of n is a prime number that divides n exactly (with zero remainder). Every composite number has at least one prime factor less than or equal to its square root.
The tool uses trial division: it tests divisibility by 2, 3, then by all numbers of the form 6k − 1 and 6k + 1 up to √n. Each time a divisor d is found, it divides n by d as many times as possible, recording the prime and its exponent.
A factorization tree shows how a number is repeatedly split into smaller factors until all leaves are prime. Each composite node is split into its smallest prime factor and the remaining quotient. Prime leaves are highlighted in green.
A positive integer n is a perfect square if and only if every prime in its factorization appears with an even exponent. For example, 36 = 2² × 3² is a perfect square; 18 = 2 × 3² is not.
Every divisor of n corresponds to choosing an exponent between 0 and ei for each prime pi. The number of such choices is (e₁+1)…(ek+1). For 10,009,493,929 = 223 × 44885623: 2 × 2 = 4 divisors.