Base | Representation |
---|---|
bin | 1000010010000011101000 |
3 | 11002022012120 |
4 | 20102003220 |
5 | 1023433422 |
6 | 114311240 |
7 | 24311526 |
oct | 10220350 |
9 | 4068176 |
10 | 2171112 |
11 | 1253209 |
12 | 888520 |
13 | 5b02a8 |
14 | 407316 |
15 | 2cd45c |
hex | 2120e8 |
2171112 has 32 divisors (see below), whose sum is σ = 5520480. Its totient is φ = 711360.
The previous prime is 2171107. The next prime is 2171119. The reversal of 2171112 is 2111712.
It is a nialpdrome in base 12.
It is a junction number, because it is equal to n+sod(n) for n = 2171091 and 2171100.
It is not an unprimeable number, because it can be changed into a prime (2171119) 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 7 ways as a sum of consecutive naturals, for example, 723 + ... + 2205.
It is an arithmetic number, because the mean of its divisors is an integer number (172515).
22171112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2171112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2760240).
2171112 is an abundant number, since it is smaller than the sum of its proper divisors (3349368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2171112 is a wasteful number, since it uses less digits than its factorization.
2171112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1553 (or 1549 counting only the distinct ones).
The product of its digits is 28, while the sum is 15.
The square root of 2171112 is about 1473.4693753180. The cubic root of 2171112 is about 129.4873697575.
Adding to 2171112 its reverse (2111712), we get a palindrome (4282824).
The spelling of 2171112 in words is "two million, one hundred seventy-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •