Base | Representation |
---|---|
bin | 1000001111011001001000 |
3 | 11001202020102 |
4 | 20033121020 |
5 | 1023111300 |
6 | 114144532 |
7 | 24234650 |
oct | 10173110 |
9 | 4052212 |
10 | 2160200 |
11 | 1245a99 |
12 | 882148 |
13 | 5a8333 |
14 | 403360 |
15 | 2ca0d5 |
hex | 20f648 |
2160200 has 48 divisors (see below), whose sum is σ = 5743680. Its totient is φ = 740160.
The previous prime is 2160161. The next prime is 2160203. The reversal of 2160200 is 20612.
It is an Ulam number.
It is not an unprimeable number, because it can be changed into a prime (2160203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 629 + ... + 2171.
It is an arithmetic number, because the mean of its divisors is an integer number (119660).
22160200 is an apocalyptic number.
2160200 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 2160200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2871840).
2160200 is an abundant number, since it is smaller than the sum of its proper divisors (3583480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2160200 is a wasteful number, since it uses less digits than its factorization.
2160200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1566 (or 1557 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 2160200 is about 1469.7618854767. The cubic root of 2160200 is about 129.2700709727.
Adding to 2160200 its reverse (20612), we get a palindrome (2180812).
It can be divided in two parts, 2 and 160200, that multiplied together give a triangular number (320400 = T800).
The spelling of 2160200 in words is "two million, one hundred sixty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •