×

注意!页面内容来自https://www.numbers.education/72.html,本站不储存任何内容,为了更好的阅读体验进行在线解析,若有广告出现,请及时反馈。若您觉得侵犯了您的利益,请通知我们进行删除,然后访问 原网页

Parity of 72

72 is an even numberbecause it is evenly divisible by 2: 72 / 2 = 36.

Find out more:

Is 72 a perfect square number?

A number is a perfect square (or a square number) if its square root is an integer; that is to sayit is the product of an integer with itself. Herethe square root of 72 is about 8.485.

Thusthe square root of 72 is not an integerand therefore 72 is not a square number.

What is the square number of 72?

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

The square of 72 is 5 184 because 72 × 72 = 722 = 5 184.

As a consequence72 is the square root of 5 184.

Number of digits of 72

72 is a number with 2 digits.

What are the multiples of 72?

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

  • 0: indeed0 is divisible by any natural numberand it is thus a multiple of 72 toosince 0 × 72 = 0
  • 72: indeed72 is a multiple of itselfsince 72 is evenly divisible by 72 (we have 72 / 72 = 1so the remainder of this division is indeed zero)
  • 144: indeed144 = 72 × 2
  • 216: indeed216 = 72 × 3
  • 288: indeed288 = 72 × 4
  • 360: indeed360 = 72 × 5
  • etc.

How to determine whether an integer is a prime number?

To determine the primality of a numberseveral 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 72). Firstwe can eliminate all even numbers greater than 2 (and hence 468…). Thenwe 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 8.485). Historicallythe sieve of Eratosthenes (dating from the Greek mathematics) implements this technique in a relatively efficient manner.

More modern techniques include the sieve of Atkinprobabilistic algorithmsand the cyclotomic AKS test.

Numbers near 72

  • Preceding numbers: …7071
  • Following numbers: 7374

Nearest numbers from 72

  • Preceding prime number: 71
  • Following prime number: 73
Find out whether some integer is a prime number

A few prime numbers

List of prime numbers

And also…

Nombres premiers

Números primos