Base | Representation |
---|---|
bin | 10100100101111011… |
… | …111110101001011000 |
3 | 2010001222100021002200 |
4 | 110211323332221120 |
5 | 330240444112233 |
6 | 14054030130200 |
7 | 1411640042535 |
oct | 244573765130 |
9 | 63058307080 |
10 | 22111316568 |
11 | 9417297450 |
12 | 4351050960 |
13 | 2114c28693 |
14 | 10da879d8c |
15 | 8962bb313 |
hex | 525efea58 |
22111316568 has 192 divisors, whose sum is σ = 69022886400. Its totient is φ = 6331395840.
The previous prime is 22111316567. The next prime is 22111316599. The reversal of 22111316568 is 86561311122.
It is a super-2 number, since 2×221113165682 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22111316567) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1069255 + ... + 1089737.
It is an arithmetic number, because the mean of its divisors is an integer number (359494200).
Almost surely, 222111316568 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 22111316568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34511443200).
22111316568 is an abundant number, since it is smaller than the sum of its proper divisors (46911569832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22111316568 is a wasteful number, since it uses less digits than its factorization.
22111316568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20582 (or 20575 counting only the distinct ones).
The product of its digits is 17280, while the sum is 36.
The spelling of 22111316568 in words is "twenty-two billion, one hundred eleven million, three hundred sixteen thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •