Base | Representation |
---|---|
bin | 100110010011… |
… | …1111000000000 |
3 | 1101210111012000 |
4 | 1030213320000 |
5 | 20120230042 |
6 | 1554304000 |
7 | 332505363 |
oct | 114477000 |
9 | 41714160 |
10 | 20086272 |
11 | 1037a128 |
12 | 6888000 |
13 | 421378b |
14 | 294c0da |
15 | 1b6b74c |
hex | 1327e00 |
20086272 has 80 divisors (see below), whose sum is σ = 59497680. Its totient is φ = 6690816.
The previous prime is 20086271. The next prime is 20086273. The reversal of 20086272 is 27268002.
It is an interprime number because it is at equal distance from previous prime (20086271) and next prime (20086273).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a zygodrome in base 8.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20086271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13098 + ... + 14550.
It is an arithmetic number, because the mean of its divisors is an integer number (743721).
Almost surely, 220086272 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 20086272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29748840).
20086272 is an abundant number, since it is smaller than the sum of its proper divisors (39411408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20086272 is an equidigital number, since it uses as much as digits as its factorization.
20086272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1480 (or 1458 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 20086272 is about 4481.7710784912. The cubic root of 20086272 is about 271.8314988664.
The spelling of 20086272 in words is "twenty million, eighty-six thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •