Base | Representation |
---|---|
bin | 100111111010… |
… | …1111001000000 |
3 | 1110101100201100 |
4 | 1033311321000 |
5 | 20324230422 |
6 | 2024334400 |
7 | 342621510 |
oct | 117657100 |
9 | 43340640 |
10 | 20930112 |
11 | 108a6115 |
12 | 7014400 |
13 | 444a8a8 |
14 | 2acb840 |
15 | 1c867ac |
hex | 13f5e40 |
20930112 has 168 divisors, whose sum is σ = 71323200. Its totient is φ = 5741568.
The previous prime is 20930101. The next prime is 20930113. The reversal of 20930112 is 21103902.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (168).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20930113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 116839 + ... + 117017.
Almost surely, 220930112 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 20930112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35661600).
20930112 is an abundant number, since it is smaller than the sum of its proper divisors (50393088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20930112 is a wasteful number, since it uses less digits than its factorization.
20930112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233 (or 220 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
The square root of 20930112 is about 4574.9439340827. The cubic root of 20930112 is about 275.5860208348.
The spelling of 20930112 in words is "twenty million, nine hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •