Base | Representation |
---|---|
bin | 1010000000101000111001… |
… | …10101000110001001100000 |
3 | 2212221100022102222000200000 |
4 | 11000110130311012021200 |
5 | 10341121431403312424 |
6 | 114452132212100000 |
7 | 4431220420650306 |
oct | 500243465061140 |
9 | 85840272860600 |
10 | 22012191072864 |
11 | 7017355005353 |
12 | 257613a304600 |
13 | c3898245c795 |
14 | 561577c66276 |
15 | 2828c32783c9 |
hex | 14051cd46260 |
22012191072864 has 576 divisors, whose sum is σ = 73891527091200. Its totient is φ = 6403090341888.
The previous prime is 22012191072853. The next prime is 22012191072931. The reversal of 22012191072864 is 46827019121022.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 117954222 + ... + 118140690.
It is an arithmetic number, because the mean of its divisors is an integer number (128283901200).
Almost surely, 222012191072864 is an apocalyptic number.
22012191072864 is a gapful number since it is divisible by the number (24) 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 22012191072864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36945763545600).
22012191072864 is an abundant number, since it is smaller than the sum of its proper divisors (51879336018336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22012191072864 is a wasteful number, since it uses less digits than its factorization.
22012191072864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186577 (or 186557 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 45.
The spelling of 22012191072864 in words is "twenty-two trillion, twelve billion, one hundred ninety-one million, seventy-two thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •