Base | Representation |
---|---|
bin | 10011001110111110… |
… | …101011001110001010 |
3 | 1222022022010220112200 |
4 | 103032332223032022 |
5 | 314244003440032 |
6 | 13253152421030 |
7 | 1330533360111 |
oct | 231676531612 |
9 | 58268126480 |
10 | 20652405642 |
11 | 8838821040 |
12 | 4004547776 |
13 | 1c418c188b |
14 | ddcbd0c78 |
15 | 80d18b47c |
hex | 4cefab38a |
20652405642 has 96 divisors (see below), whose sum is σ = 52477701120. Its totient is φ = 5802723360.
The previous prime is 20652405637. The next prime is 20652405701. The reversal of 20652405642 is 24650425602.
20652405642 is a `hidden beast` number, since 2 + 0 + 6 + 5 + 2 + 4 + 0 + 5 + 642 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 20652405597 and 20652405606.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 118413 + ... + 235215.
It is an arithmetic number, because the mean of its divisors is an integer number (546642720).
Almost surely, 220652405642 is an apocalyptic number.
20652405642 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 20652405642, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26238850560).
20652405642 is an abundant number, since it is smaller than the sum of its proper divisors (31825295478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20652405642 is a wasteful number, since it uses less digits than its factorization.
20652405642 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116888 (or 116885 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 36.
The spelling of 20652405642 in words is "twenty billion, six hundred fifty-two million, four hundred five thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •