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

## Parity of 130

130 is an even number, because it is evenly divisible by 2: 130 / 2 = 65.

Find out more:

## Is 130 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 130 is about 11.402.

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

## What is the square number of 130?

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

The square of 130 is 16 900 because 130 × 130 = 1302 = 16 900.

As a consequence, 130 is the square root of 16 900.

## Number of digits of 130

130 is a number with 3 digits.

## What are the multiples of 130?

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

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

• Preceding numbers: …128, 129
• Following numbers: 131, 132

### Nearest numbers from 130

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