Base | Representation |
---|---|
bin | 10011001001101101… |
… | …111110101000011100 |
3 | 1222002011001200102212 |
4 | 103021231332220130 |
5 | 314103410030440 |
6 | 13240320535552 |
7 | 1325412220400 |
oct | 231155765034 |
9 | 58064050385 |
10 | 20564142620 |
11 | 87a2a1679a |
12 | 3b9aa815b8 |
13 | 1c2952a438 |
14 | dd11b7100 |
15 | 805554465 |
hex | 4c9b7ea1c |
20564142620 has 72 divisors (see below), whose sum is σ = 50572771200. Its totient is φ = 7003194240.
The previous prime is 20564142593. The next prime is 20564142649. The reversal of 20564142620 is 2624146502.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 75605 + ... + 216435.
It is an arithmetic number, because the mean of its divisors is an integer number (702399600).
Almost surely, 220564142620 is an apocalyptic number.
20564142620 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 20564142620, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25286385600).
20564142620 is an abundant number, since it is smaller than the sum of its proper divisors (30008628580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20564142620 is a wasteful number, since it uses less digits than its factorization.
20564142620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141003 (or 140994 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 32.
The spelling of 20564142620 in words is "twenty billion, five hundred sixty-four million, one hundred forty-two thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •