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

## Parity of 134

134 is an even number, because it is evenly divisible by 2: 134 / 2 = 67.

Find out more:

## Is 134 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 134 is about 11.576.

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

## What is the square number of 134?

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

The square of 134 is 17 956 because 134 × 134 = 1342 = 17 956.

As a consequence, 134 is the square root of 17 956.

## Number of digits of 134

134 is a number with 3 digits.

## What are the multiples of 134?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 134 too, since 0 × 134 = 0
• 134: indeed, 134 is a multiple of itself, since 134 is evenly divisible by 134 (we have 134 / 134 = 1, so the remainder of this division is indeed zero)
• 268: indeed, 268 = 134 × 2
• 402: indeed, 402 = 134 × 3
• 536: indeed, 536 = 134 × 4
• 670: indeed, 670 = 134 × 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 134). 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.576). 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 134

• Preceding numbers: …132, 133
• Following numbers: 135, 136

### Nearest numbers from 134

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