2970 has 32 divisors (see below), whose sum is σ = 8640. Its totient is φ = 720.
The previous prime is 2969. The next prime is 2971. The reversal of 2970 is 792.
It is an interprime number because it is at equal distance from previous prime (2969) and next prime (2971).
It is a harmonic number, since the harmonic mean of its divisors is an integer.
It is a Smith number, since the sum of its digits (18) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a plaindrome in base 14.
It is a nialpdrome in base 15.
It is a zygodrome in base 14.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 265 + ... + 275.
It is an arithmetic number, because the mean of its divisors is an integer number (270).
It is a pronic number, being equal to 54×55.
It is a practical number, because each smaller number is the sum of distinct divisors of 2970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4320).
2970 is an abundant number, since it is smaller than the sum of its proper divisors (5670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2970 is a wasteful number, since it uses less digits than its factorization.
2970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27 (or 21 counting only the distinct ones).
The product of its (nonzero) digits is 126, while the sum is 18.
The square root of 2970 is about 54.4977063738. The cubic root of 2970 is about 14.3742595712.
It can be divided in two parts, 29 and 70, that added together give a palindrome (99).
The spelling of 2970 in words is "two thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •