Base | Representation |
---|---|
bin | 100110101010… |
… | …1001110000000 |
3 | 1102010220221211 |
4 | 1031111032000 |
5 | 20142201000 |
6 | 2002255504 |
7 | 334211020 |
oct | 115251600 |
9 | 42126854 |
10 | 20272000 |
11 | 10496721 |
12 | 6957594 |
13 | 427a188 |
14 | 2999a80 |
15 | 1ba67ba |
hex | 1355380 |
20272000 has 128 divisors (see below), whose sum is σ = 57919680. Its totient is φ = 6912000.
The previous prime is 20271983. The next prime is 20272009. The reversal of 20272000 is 27202.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20272009) 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, 111910 + ... + 112090.
Almost surely, 220272000 is an apocalyptic number.
20272000 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 20272000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28959840).
20272000 is an abundant number, since it is smaller than the sum of its proper divisors (37647680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20272000 is an equidigital number, since it uses as much as digits as its factorization.
20272000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 217 (or 195 counting only the distinct ones).
The product of its (nonzero) digits is 56, while the sum is 13.
The square root of 20272000 is about 4502.4437808817. The cubic root of 20272000 is about 272.6667609856. Note that the first 3 decimals are identical.
Adding to 20272000 its reverse (27202), we get a palindrome (20299202).
The spelling of 20272000 in words is "twenty million, two hundred seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •