Base | Representation |
---|---|
bin | 1010000000100110101101… |
… | …00011010010100100000000 |
3 | 2212221020021021022220202200 |
4 | 11000103112203102210000 |
5 | 10341112023033000000 |
6 | 114451415212313200 |
7 | 4431146253002142 |
oct | 500232643224400 |
9 | 85836237286680 |
10 | 22011012000000 |
11 | 70168aa4a2471 |
12 | 2575a6b472800 |
13 | c388250b472a |
14 | 5614a5422c92 |
15 | 2828549c3500 |
hex | 1404d68d2900 |
22011012000000 has 1512 divisors, whose sum is σ = 82891123355040. Its totient is φ = 5612544000000.
The previous prime is 22011011999969. The next prime is 22011012000037. The reversal of 22011012000000 is 21011022.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 167 ways as a sum of consecutive naturals, for example, 91331999880 + ... + 91332000120.
Almost surely, 222011012000000 is an apocalyptic number.
22011012000000 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 22011012000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41445561677520).
22011012000000 is an abundant number, since it is smaller than the sum of its proper divisors (60880111355040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22011012000000 is an frugal number, since it uses more digits than its factorization.
22011012000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395 (or 353 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 22011012000000 its reverse (21011022), we get a palindrome (22011033011022).
The spelling of 22011012000000 in words is "twenty-two trillion, eleven billion, twelve million", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •