It is possible to find out using mathematical methods whether a given integer is a prime number or not.
For 13, the answer is: yes, 13 is a prime number because it has only two distinct divisors: 1 and itself (13).
As a consequence, 13 is only a multiple of 1 and 13..
Since 13 is a prime number, 13 is also a deficient number, that is to say 13 is a natural integer that is strictly larger than the sum of its proper divisors, i.e., the divisors of 13 without 13 itself (that is 1, by definition!).
Parity of 13
13 is an odd number, because it is not evenly divisible by 2.
Is 13 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 13 is about 3.606.
Thus, the square root of 13 is not an integer, and therefore 13 is not a square number.
Anyway, 13 is a prime number, and a prime number cannot be a perfect square.
What is the square number of 13?
The square of a number (here 13) is the result of the product of this number (13) by itself (i.e., 13 × 13); the square of 13 is sometimes called "raising 13 to the power 2", or "13 squared".
As a consequence, 13 is the square root of 169.
Number of digits of 13
13 is a number with 2 digits.
What are the multiples of 13?
The multiples of 13 are all integers evenly divisible by 13, that is all numbers such that the remainder of the division by 13 is zero. There are infinitely many multiples of 13. The smallest multiples of 13 are:
- 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 13 too, since 0 × 13 = 0
- 13: indeed, 13 is a multiple of itself, since 13 is evenly divisible by 13 (we have 13 / 13 = 1, so the remainder of this division is indeed zero)
- 26: indeed, 26 = 13 × 2
- 39: indeed, 39 = 13 × 3
- 52: indeed, 52 = 13 × 4
- 65: indeed, 65 = 13 × 5
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 13). 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 3.606). 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.