Base | Representation |
---|---|
bin | 1001001101110110011000… |
… | …10100110110001110000000 |
3 | 2122202111212220121020022210 |
4 | 10212323030110312032000 |
5 | 10124023441413011202 |
6 | 111034323021102120 |
7 | 4161151141130115 |
oct | 446731424661600 |
9 | 78674786536283 |
10 | 20267083719552 |
11 | 650424944167a |
12 | 2333a913b7940 |
13 | b402407c9407 |
14 | 500d0990290c |
15 | 2522d78b2c6c |
hex | 126ecc536380 |
20267083719552 has 256 divisors, whose sum is σ = 56471491768320. Its totient is φ = 6427941273600.
The previous prime is 20267083719541. The next prime is 20267083719587. The reversal of 20267083719552 is 25591738076202.
It is a junction number, because it is equal to n+sod(n) for n = 20267083719492 and 20267083719501.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1754568177 + ... + 1754579727.
It is an arithmetic number, because the mean of its divisors is an integer number (220591764720).
Almost surely, 220267083719552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20267083719552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28235745884160).
20267083719552 is an abundant number, since it is smaller than the sum of its proper divisors (36204408048768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20267083719552 is a wasteful number, since it uses less digits than its factorization.
20267083719552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12621 (or 12609 counting only the distinct ones).
The product of its (nonzero) digits is 12700800, while the sum is 57.
The spelling of 20267083719552 in words is "twenty trillion, two hundred sixty-seven billion, eighty-three million, seven hundred nineteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •