Is 539 a prime number?

It is possible to find out using mathematical methods whether a given integer is a prime number or not.

For 539, the answer is: No, 539 is not a prime number.

The list of all positive divisors (i.e., the list of all integers that divide 539) is as follows: 1, 7, 11, 49, 77, 539.

For 539 to be a prime number, it would have been required that 539 has only two divisors, i.e., itself and 1.

Find out more:

What is a prime number?

As a consequence:

539 is a multiple of 1
539 is a multiple of 7
539 is a multiple of 11
539 is a multiple of 49
539 is a multiple of 77

For 539 to be a prime number, it would have been required that 539 has only two divisors, i.e., itself and 1.

Is 539 a deficient number?

Yes, 539 is a deficient number, that is to say 539 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 539 without 539 itself (that is 1 + 7 + 11 + 49 + 77 = 145).

Parity of 539

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

Find out more:

What is an even number?

Is 539 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 539 is about 23.216.

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

What is the square number of 539?

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

The square of 539 is 290 521 because 539 × 539 = 539² = 290 521.

As a consequence, 539 is the square root of 290 521.

Number of digits of 539

539 is a number with 3 digits.

What are the multiples of 539?

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

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 539 too, since 0 × 539 = 0
539: indeed, 539 is a multiple of itself, since 539 is evenly divisible by 539 (we have 539 / 539 = 1, so the remainder of this division is indeed zero)
1 078: indeed, 1 078 = 539 × 2
1 617: indeed, 1 617 = 539 × 3
2 156: indeed, 2 156 = 539 × 4
2 695: indeed, 2 695 = 539 × 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 539). 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 23.216). 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 539

Preceding numbers: …537, 538
Following numbers: 540, 541…

Nearest numbers from 539

Preceding prime number: 523
Following prime number: 541