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