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

Is 938 a prime number?

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

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

The list of all positive divisors (i.e., the list of all integers that divide 938) is as follows: 1, 2, 7, 14, 67, 134, 469, 938.

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

As a consequence:

  • 938 is a multiple of 1
  • 938 is a multiple of 2
  • 938 is a multiple of 7
  • 938 is a multiple of 14
  • 938 is a multiple of 67
  • 938 is a multiple of 134
  • 938 is a multiple of 469

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

Is 938 a deficient number?

Yes, 938 is a deficient number, that is to say 938 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 938 without 938 itself (that is 1 + 2 + 7 + 14 + 67 + 134 + 469 = 694).

Parity of 938

938 is an even number, because it is evenly divisible by 2: 938 / 2 = 469.

Is 938 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 938 is about 30.627.

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

What is the square number of 938?

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

The square of 938 is 879 844 because 938 × 938 = 9382 = 879 844.

As a consequence, 938 is the square root of 879 844.

Number of digits of 938

938 is a number with 3 digits.

What are the multiples of 938?

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

  • 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 938 too, since 0 × 938 = 0
  • 938: indeed, 938 is a multiple of itself, since 938 is evenly divisible by 938 (we have 938 / 938 = 1, so the remainder of this division is indeed zero)
  • 1 876: indeed, 1 876 = 938 × 2
  • 2 814: indeed, 2 814 = 938 × 3
  • 3 752: indeed, 3 752 = 938 × 4
  • 4 690: indeed, 4 690 = 938 × 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 938). 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.627). 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 938

  • Preceding numbers: …936, 937
  • Following numbers: 939, 940

Nearest numbers from 938

  • Preceding prime number: 937
  • Following prime number: 941
Find out whether some integer is a prime number