Base | Representation |
---|---|
bin | 1010000110101110000001… |
… | …10001011010001101101110 |
3 | 2220200022112122222002211210 |
4 | 11003113000301122031232 |
5 | 10403032303100000420 |
6 | 115132122111255250 |
7 | 4452264400354164 |
oct | 503270061321556 |
9 | 86608478862753 |
10 | 22221100000110 |
11 | 7097a08713440 |
12 | 25aa72151a526 |
13 | c525963c292b |
14 | 56b715213234 |
15 | 28804d8d99e0 |
hex | 1435c0c5a36e |
22221100000110 has 128 divisors (see below), whose sum is σ = 60190183157760. Its totient is φ = 5200733260800.
The previous prime is 22221100000097. The next prime is 22221100000111. The reversal of 22221100000110 is 1100000112222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22221100000111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 119637474 + ... + 119823066.
It is an arithmetic number, because the mean of its divisors is an integer number (470235805920).
Almost surely, 222221100000110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22221100000110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30095091578880).
22221100000110 is an abundant number, since it is smaller than the sum of its proper divisors (37969083157650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22221100000110 is a wasteful number, since it uses less digits than its factorization.
22221100000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198154.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 22221100000110 its reverse (1100000112222), we get a palindrome (23321100112332).
The spelling of 22221100000110 in words is "twenty-two trillion, two hundred twenty-one billion, one hundred million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •