Is 39 a prime number? What are the divisors of 39?

## Parity of 39

39 is an odd number, because it is not evenly divisible by 2.

Find out more:

## Is 39 a perfect square number?

A number is a perfect square (or a square number) if its square root is an integer; that is to say, it is the product of an integer with itself. Here, the square root of 39 is about 6.245.

Thus, the square root of 39 is not an integer, and therefore 39 is not a square number.

## What is the square number of 39?

The square of a number (here 39) is the result of the product of this number (39) by itself (i.e., 39 × 39); the square of 39 is sometimes called "raising 39 to the power 2", or "39 squared".

The square of 39 is 1 521 because 39 × 39 = 392 = 1 521.

As a consequence, 39 is the square root of 1 521.

## Number of digits of 39

39 is a number with 2 digits.

## What are the multiples of 39?

The multiples of 39 are all integers evenly divisible by 39, that is all numbers such that the remainder of the division by 39 is zero. There are infinitely many multiples of 39. The smallest multiples of 39 are:

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 39 too, since 0 × 39 = 0
• 39: indeed, 39 is a multiple of itself, since 39 is evenly divisible by 39 (we have 39 / 39 = 1, so the remainder of this division is indeed zero)
• 78: indeed, 78 = 39 × 2
• 117: indeed, 117 = 39 × 3
• 156: indeed, 156 = 39 × 4
• 195: indeed, 195 = 39 × 5
• etc.

## How to determine whether an integer is a prime number?

To determine the primality of a number, several algorithms can be used. The most naive technique is to test all divisors strictly smaller to the number of which we want to determine the primality (here 39). First, we can eliminate all even numbers greater than 2 (and hence 4, 6, 8…). Then, we can stop this check when we reach the square root of the number of which we want to determine the primality (here the square root is about 6.245). Historically, the sieve of Eratosthenes (dating from the Greek mathematics) implements this technique in a relatively efficient manner.

More modern techniques include the sieve of Atkin, probabilistic algorithms, and the cyclotomic AKS test.

## Numbers near 39

• Preceding numbers: …37, 38
• Following numbers: 40, 41

### Nearest numbers from 39

• Preceding prime number: 37
• Following prime number: 41
Find out whether some integer is a prime number