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

## Parity of 132

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

Find out more:

## Is 132 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 132 is about 11.489.

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

## What is the square number of 132?

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

The square of 132 is 17 424 because 132 × 132 = 1322 = 17 424.

As a consequence, 132 is the square root of 17 424.

## Number of digits of 132

132 is a number with 3 digits.

## What are the multiples of 132?

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

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

• Preceding numbers: …130, 131
• Following numbers: 133, 134

### Nearest numbers from 132

• Preceding prime number: 131
• Following prime number: 137
Find out whether some integer is a prime number