Base | Representation |
---|---|
bin | 100111111010… |
… | …1001111101010 |
3 | 1110101020002100 |
4 | 1033311033222 |
5 | 20324134331 |
6 | 2024314230 |
7 | 342611010 |
oct | 117651752 |
9 | 43336070 |
10 | 20927466 |
11 | 108a412a |
12 | 7012976 |
13 | 4449621 |
14 | 2aca8b0 |
15 | 1c85ae6 |
hex | 13f53ea |
20927466 has 48 divisors (see below), whose sum is σ = 53097408. Its totient is φ = 5832000.
The previous prime is 20927461. The next prime is 20927471. The reversal of 20927466 is 66472902.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20927461) and next prime (20927471).
It is a self number, because there is not a number n which added to its sum of digits gives 20927466.
It is not an unprimeable number, because it can be changed into a prime (20927461) 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, 3141 + ... + 7191.
It is an arithmetic number, because the mean of its divisors is an integer number (1106196).
Almost surely, 220927466 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20927466, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26548704).
20927466 is an abundant number, since it is smaller than the sum of its proper divisors (32169942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20927466 is a wasteful number, since it uses less digits than its factorization.
20927466 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4107 (or 4104 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
The square root of 20927466 is about 4574.6547410706. The cubic root of 20927466 is about 275.5744070836.
The spelling of 20927466 in words is "twenty million, nine hundred twenty-seven thousand, four hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.000 sec. • engine limits •