Base | Representation |
---|---|
bin | 100111010100… |
… | …1010111100000 |
3 | 1102210102202110 |
4 | 1032221113200 |
5 | 20234213142 |
6 | 2013515320 |
7 | 340144626 |
oct | 116512740 |
9 | 42712673 |
10 | 20616672 |
11 | 1070167a |
12 | 6aa2b40 |
13 | 436b01b |
14 | 2a49516 |
15 | 1c2399c |
hex | 13a95e0 |
20616672 has 96 divisors (see below), whose sum is σ = 58060800. Its totient is φ = 6386688.
The previous prime is 20616667. The next prime is 20616677. The reversal of 20616672 is 27661602.
It is an interprime number because it is at equal distance from previous prime (20616667) and next prime (20616677).
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20616677) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 162273 + ... + 162399.
It is an arithmetic number, because the mean of its divisors is an integer number (604800).
Almost surely, 220616672 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 20616672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29030400).
20616672 is an abundant number, since it is smaller than the sum of its proper divisors (37444128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20616672 is a wasteful number, since it uses less digits than its factorization.
20616672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 248 (or 240 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 30.
The square root of 20616672 is about 4540.5585559488. The cubic root of 20616672 is about 274.2034115665.
The spelling of 20616672 in words is "twenty million, six hundred sixteen thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •