Is 913 a prime number?

It is possible to find out using mathematical methods whether a given integer is a prime number or not.

For 913, the answer is: No, 913 is not a prime number.

The list of all positive divisors (i.e., the list of all integers that divide 913) is as follows: 1, 11, 83, 913.

For 913 to be a prime number, it would have been required that 913 has only two divisors, i.e., itself and 1.

Find out more:

What is a prime number?

As a consequence:

913 is a multiple of 1
913 is a multiple of 11
913 is a multiple of 83

For 913 to be a prime number, it would have been required that 913 has only two divisors, i.e., itself and 1.

However, 913 is a semiprime (also called biprime or 2-almost-prime), because it is the product of a two non-necessarily distinct prime numbers. Indeed, 913 = 11 x 83, where 11 and 83 are both prime numbers.

Is 913 a deficient number?

Yes, 913 is a deficient number, that is to say 913 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 913 without 913 itself (that is 1 + 11 + 83 = 95).

Parity of 913

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

Find out more:

What is an even number?

Is 913 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 913 is about 30.216.

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

What is the square number of 913?

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

The square of 913 is 833 569 because 913 × 913 = 913² = 833 569.

As a consequence, 913 is the square root of 833 569.

Number of digits of 913

913 is a number with 3 digits.

What are the multiples of 913?

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

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 913 too, since 0 × 913 = 0
913: indeed, 913 is a multiple of itself, since 913 is evenly divisible by 913 (we have 913 / 913 = 1, so the remainder of this division is indeed zero)
1 826: indeed, 1 826 = 913 × 2
2 739: indeed, 2 739 = 913 × 3
3 652: indeed, 3 652 = 913 × 4
4 565: indeed, 4 565 = 913 × 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 913). 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 30.216). 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 913

Preceding numbers: …911, 912
Following numbers: 914, 915…

Nearest numbers from 913

Preceding prime number: 911
Following prime number: 919