31152 has 40 divisors (see below), whose sum is σ = 89280. Its totient is φ = 9280.
The previous prime is 31151. The next prime is 31153. The reversal of 31152 is 25113.
31152 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (31151) and next prime (31153).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a plaindrome in base 13.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 31152.
It is not an unprimeable number, because it can be changed into a prime (31151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 499 + ... + 557.
It is an arithmetic number, because the mean of its divisors is an integer number (2232).
231152 is an apocalyptic number.
It is a pronic number, being equal to 176×177.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44640).
31152 is an abundant number, since it is smaller than the sum of its proper divisors (58128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31152 is a wasteful number, since it uses less digits than its factorization.
31152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81 (or 75 counting only the distinct ones).
The product of its digits is 30, while the sum is 12.
The square root of 31152 is about 176.4992917833. The cubic root of 31152 is about 31.4650658319.
Adding to 31152 its reverse (25113), we get a palindrome (56265).
It can be divided in two parts, 311 and 52, that added together give a palindrome (363).
The spelling of 31152 in words is "thirty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •