Base | Representation |
---|---|
bin | 1001010110100101110011… |
… | …00001110001010010011000 |
3 | 2200211020002120212102220010 |
4 | 10223102321201301102120 |
5 | 10143434032002111330 |
6 | 111424312425201520 |
7 | 4221642512620401 |
oct | 453227141612230 |
9 | 80736076772803 |
10 | 20567416050840 |
11 | 660a65719532a |
12 | 238212a0302a0 |
13 | b62664435c49 |
14 | 51167ac329a8 |
15 | 25a01431a3b0 |
hex | 12b4b9871498 |
20567416050840 has 64 divisors (see below), whose sum is σ = 61757192678400. Its totient is φ = 5479760322432.
The previous prime is 20567416050809. The next prime is 20567416050851. The reversal of 20567416050840 is 4805061476502.
It is a super-2 number, since 2×205674160508402 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20567416050840.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76176520 + ... + 76446039.
It is an arithmetic number, because the mean of its divisors is an integer number (964956135600).
Almost surely, 220567416050840 is an apocalyptic number.
20567416050840 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20567416050840 is an abundant number, since it is smaller than the sum of its proper divisors (41189776627560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20567416050840 is a wasteful number, since it uses less digits than its factorization.
20567416050840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152623696 (or 152623692 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 48.
The spelling of 20567416050840 in words is "twenty trillion, five hundred sixty-seven billion, four hundred sixteen million, fifty thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •