Base | Representation |
---|---|
bin | 101000000000… |
… | …0111000100000 |
3 | 1110110122110220 |
4 | 1100000320200 |
5 | 20332201021 |
6 | 2025323040 |
7 | 343200000 |
oct | 120007040 |
9 | 43418426 |
10 | 20975136 |
11 | 10926a26 |
12 | 7036480 |
13 | 4465230 |
14 | 2b00000 |
15 | 1c94cc6 |
hex | 1400e20 |
20975136 has 144 divisors (see below), whose sum is σ = 69177024. Its totient is φ = 5531904.
The previous prime is 20975131. The next prime is 20975137. The reversal of 20975136 is 63157902.
It is a junction number, because it is equal to n+sod(n) for n = 20975097 and 20975106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20975131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1613466 + ... + 1613478.
It is an arithmetic number, because the mean of its divisors is an integer number (480396).
Almost surely, 220975136 is an apocalyptic number.
20975136 is a gapful number since it is divisible by the number (26) 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 20975136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34588512).
20975136 is an abundant number, since it is smaller than the sum of its proper divisors (48201888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20975136 is an frugal number, since it uses more digits than its factorization.
20975136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61 (or 25 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 33.
The square root of 20975136 is about 4579.8620066548. The cubic root of 20975136 is about 275.7834890955.
The spelling of 20975136 in words is "twenty million, nine hundred seventy-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •