Base | Representation |
---|---|
bin | 1010000000100111000100… |
… | …11010011111101110010000 |
3 | 2212221020210010211020112020 |
4 | 11000103202122133232100 |
5 | 10341112430010134300 |
6 | 114451451042131440 |
7 | 4431154220441652 |
oct | 500234232375620 |
9 | 85836703736466 |
10 | 22011211021200 |
11 | 70169a1876aa5 |
12 | 2575b06050b80 |
13 | c388573b835b |
14 | 5614c3a2c6d2 |
15 | 2828671d78a0 |
hex | 1404e269fb90 |
22011211021200 has 240 divisors, whose sum is σ = 74476388253696. Its totient is φ = 5548211827200.
The previous prime is 22011211021199. The next prime is 22011211021223. The reversal of 22011211021200 is 212011211022.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 22011211021200.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5280624 + ... + 8479823.
Almost surely, 222011211021200 is an apocalyptic number.
22011211021200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22011211021200 is an abundant number, since it is smaller than the sum of its proper divisors (52465177232496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22011211021200 is a wasteful number, since it uses less digits than its factorization.
22011211021200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13760542 (or 13760531 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22011211021200 its reverse (212011211022), we get a palindrome (22223222232222).
The spelling of 22011211021200 in words is "twenty-two trillion, eleven billion, two hundred eleven million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •