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

## Parity of 247

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

Find out more:

## Is 247 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 247 is about 15.716.

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

## What is the square number of 247?

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

The square of 247 is 61 009 because 247 × 247 = 2472 = 61 009.

As a consequence, 247 is the square root of 61 009.

## Number of digits of 247

247 is a number with 3 digits.

## What are the multiples of 247?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 247 too, since 0 × 247 = 0
• 247: indeed, 247 is a multiple of itself, since 247 is evenly divisible by 247 (we have 247 / 247 = 1, so the remainder of this division is indeed zero)
• 494: indeed, 494 = 247 × 2
• 741: indeed, 741 = 247 × 3
• 988: indeed, 988 = 247 × 4
• 1 235: indeed, 1 235 = 247 × 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 247). 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 15.716). 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 247

• Preceding numbers: …245, 246
• Following numbers: 248, 249

### Nearest numbers from 247

• Preceding prime number: 241
• Following prime number: 251
Find out whether some integer is a prime number