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

## Parity of 66

66 is an even number, because it is evenly divisible by 2: 66 / 2 = 33.

Find out more:

## Is 66 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 66 is about 8.124.

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

## What is the square number of 66?

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

The square of 66 is 4 356 because 66 × 66 = 662 = 4 356.

As a consequence, 66 is the square root of 4 356.

## Number of digits of 66

66 is a number with 2 digits.

## What are the multiples of 66?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 66 too, since 0 × 66 = 0
• 66: indeed, 66 is a multiple of itself, since 66 is evenly divisible by 66 (we have 66 / 66 = 1, so the remainder of this division is indeed zero)
• 132: indeed, 132 = 66 × 2
• 198: indeed, 198 = 66 × 3
• 264: indeed, 264 = 66 × 4
• 330: indeed, 330 = 66 × 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 66). 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 8.124). 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 66

• Preceding numbers: …64, 65
• Following numbers: 67, 68

### Nearest numbers from 66

• Preceding prime number: 61
• Following prime number: 67
Find out whether some integer is a prime number