Base | Representation |
---|---|
bin | 10011000110110111… |
… | …101101100101110110 |
3 | 1221221211011012121000 |
4 | 103012313231211312 |
5 | 314004142100424 |
6 | 13231452504130 |
7 | 1324262130156 |
oct | 230667554566 |
9 | 57854135530 |
10 | 20516362614 |
11 | 8778a51990 |
12 | 3b86a7b046 |
13 | 1c1c66b647 |
14 | dc8ada766 |
15 | 8012673c9 |
hex | 4c6ded976 |
20516362614 has 64 divisors (see below), whose sum is σ = 49921920000. Its totient is φ = 6193919520.
The previous prime is 20516362613. The next prime is 20516362631. The reversal of 20516362614 is 41626361502.
20516362614 is a `hidden beast` number, since 2 + 0 + 5 + 1 + 6 + 36 + 2 + 614 = 666.
It is a super-2 number, since 2×205163626142 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20516362613) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 95587 + ... + 223985.
It is an arithmetic number, because the mean of its divisors is an integer number (780030000).
Almost surely, 220516362614 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20516362614, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24960960000).
20516362614 is an abundant number, since it is smaller than the sum of its proper divisors (29405557386).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20516362614 is a wasteful number, since it uses less digits than its factorization.
20516362614 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128690 (or 128684 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 20516362614 in words is "twenty billion, five hundred sixteen million, three hundred sixty-two thousand, six hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •