Base | Representation |
---|---|
bin | 10100100101111011… |
… | …111111011111000000 |
3 | 2010001222100102210210 |
4 | 110211323333133000 |
5 | 330240444220000 |
6 | 14054030154120 |
7 | 1411640055540 |
oct | 244573773700 |
9 | 63058312723 |
10 | 22111320000 |
11 | 9417299a90 |
12 | 4351052940 |
13 | 2114c2a103 |
14 | 10da87b320 |
15 | 8962bc350 |
hex | 525eff7c0 |
22111320000 has 560 divisors, whose sum is σ = 91182212352. Its totient is φ = 4592640000.
The previous prime is 22111319983. The next prime is 22111320013. The reversal of 22111320000 is 2311122.
It is a tau number, because it is divible by the number of its divisors (560).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 9238804 + ... + 9241196.
Almost surely, 222111320000 is an apocalyptic number.
22111320000 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 22111320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45591106176).
22111320000 is an abundant number, since it is smaller than the sum of its proper divisors (69070892352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22111320000 is a wasteful number, since it uses less digits than its factorization.
22111320000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2446 (or 2421 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 22111320000 its reverse (2311122), we get a palindrome (22113631122).
The spelling of 22111320000 in words is "twenty-two billion, one hundred eleven million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •