201180 has 48 divisors (see below), whose sum is σ = 645120. Its totient is φ = 45888.
The previous prime is 201167. The next prime is 201193. The reversal of 201180 is 81102.
It is a happy number.
201180 is digitally balanced in base 2 and base 3, because in such bases 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 (201167) and next prime (201193).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a nialpdrome in base 12.
It is a congruent number.
It is an unprimeable number.
201180 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 181 + ... + 659.
It is an arithmetic number, because the mean of its divisors is an integer number (13440).
2201180 is an apocalyptic number.
201180 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201180, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (322560).
201180 is an abundant number, since it is smaller than the sum of its proper divisors (443940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201180 is a wasteful number, since it uses less digits than its factorization.
201180 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498 (or 496 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 201180 is about 448.5309353880. The cubic root of 201180 is about 58.5951406781.
Adding to 201180 its reverse (81102), we get a palindrome (282282).
The spelling of 201180 in words is "two hundred one thousand, one hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •