Step-by-Step Proof: Why 47 Is Prime
- 1
Compute the square-root trial limit: √47 ≈ 6.86, so we only need to test prime divisors up to ⌊√47⌋ = 6.
- 2
There are 3 primes ≤ 6: 2, 3, 5.
- 3
Dividing 47 by each of those primes leaves a non-zero remainder every time — proving conclusively that 47 has no proper prime divisors and is a prime number.
Prime Factorization & All Factors of 47
Open 47 in Visual Factor Tree →47 has 2 positive divisors with divisor sum σ(47) = 48 and aliquot sum s(47) = 1 (Deficient number).
Mathematical Properties & Number Bases of 47
Test Another Number Instantly
Enter any integer (including 100+ digit BigInt numbers) to test primality in our full Prime Number Checker.
Frequently Asked Questions About 47
Is 47 a prime number or a composite number?
Yes, 47 is a prime number. Its only positive divisors are 1 and 47 (making it the 15th prime number).
What are all the positive factors (divisors) of 47?
The 2 positive divisors of 47 are: 1, 47. Their sum is σ(47) = 48.
What is the prime factorization of 47?
Because 47 is already prime, its prime factorization is simply 47.
What are the closest prime numbers before and after 47?
The previous prime before 47 is 43, and the next prime after 47 is 53.
Prime Number Tools & Reference Guides
Explore dedicated charts, visual factor trees, range generators, and step-by-step proofs for commonly searched numbers.
Prime Number Checker
Instantly test primality for any integer (including 100+ digit BigInt numbers), find factors, and jump to neighbor primes.
Prime Numbers Chart (1 to 1000)
Interactive 1–100 highlighted prime grid, complete list of all 168 primes up to 1,000, twin primes, and Mersenne primes.
Prime Factorization & Factor Tree
Break any integer into prime factors with a visual SVG factor tree, division ladder, exponential form, and full divisor list.
Prime Number Generator & N-th Prime
Generate prime sequences up to 1,000,000 using Sieve of Eratosthenes, find the N-th prime, or create random primes & CSV exports.