Base | Representation |
---|---|
bin | 10100100101010101… |
… | …000101100001011100 |
3 | 2010001021011021120100 |
4 | 110211111011201130 |
5 | 330230341333431 |
6 | 14053023421100 |
7 | 1411454300304 |
oct | 244525054134 |
9 | 63037137510 |
10 | 22101121116 |
11 | 9411563458 |
12 | 4349754790 |
13 | 2112a98b79 |
14 | 10d9384604 |
15 | 8954554e6 |
hex | 52554585c |
22101121116 has 144 divisors (see below), whose sum is σ = 60322848768. Its totient is φ = 6797683200.
The previous prime is 22101121087. The next prime is 22101121117. The reversal of 22101121116 is 61112110122.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22101121117) 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, 8298001 + ... + 8300663.
It is an arithmetic number, because the mean of its divisors is an integer number (418908672).
Almost surely, 222101121116 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 22101121116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30161424384).
22101121116 is an abundant number, since it is smaller than the sum of its proper divisors (38221727652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22101121116 is a wasteful number, since it uses less digits than its factorization.
22101121116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2952 (or 2947 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 22101121116 its reverse (61112110122), we get a palindrome (83213231238).
The spelling of 22101121116 in words is "twenty-two billion, one hundred one million, one hundred twenty-one thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •