Is 39 a Prime Number?

NO — COMPOSITE NUMBER

No, 39 is not a prime number. It is a composite number divisible by 3 (39 = 3 × 13), with prime factorization 3 × 13.

Prime Factorization
3 × 13
Positive Divisors
4
Previous Prime
Next Prime

Step-by-Step Proof: Why 39 Is Not Prime

  1. 1

    Compute the square-root bound: ⌊√39⌋ = 6. If 39 is composite, at least one prime ≤ 6 must divide it.

  2. 2

    Testing primes in ascending order immediately finds a witness divisor: 39 ÷ 3 = 13 with remainder 0.

  3. 3

    Since 3 divides 39 evenly (1 < 3 < 39), 39 has more than two positive divisors (4 in total) and its complete prime factorization is 39 = 3 × 13.

Prime Factorization & All Factors of 39

Open 39 in Visual Factor Tree →

39 has 4 positive divisors with divisor sum σ(39) = 56 and aliquot sum s(39) = 17 (Deficient number).

1 3 13 39

Division Ladder

1. 39 ÷ 3 = 13
2. 13 ÷ 13 = 1

Mathematical Properties & Number Bases of 39

Semiprime
Parity
Odd
Aliquot Class
Deficient number
Twin Prime
No
Binary (Base 2)
100111
Octal (Base 8)
47
Hexadecimal (Base 16)
0x27

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 39

Is 39 a prime number or a composite number?

No, 39 is not a prime number. It is a composite number divisible by 3 (39 = 3 × 13), with prime factorization 3 × 13.

What are all the positive factors (divisors) of 39?

The 4 positive divisors of 39 are: 1, 3, 13, 39. Their sum is σ(39) = 56.

What is the prime factorization of 39?

The prime factorization of 39 is 3 × 13 (3 × 13).

What are the closest prime numbers before and after 39?

The previous prime before 39 is 37, and the next prime after 39 is 41.

← Previous curated number: 37 Next curated number: 41 →

Prime Number Tools & Reference Guides

Explore dedicated charts, visual factor trees, range generators, and step-by-step proofs for commonly searched numbers.