Base | Representation |
---|---|
bin | 10100011111111101… |
… | …010101111111001110 |
3 | 2002210222121012202110 |
4 | 110133331111333032 |
5 | 330034304323042 |
6 | 14040044204450 |
7 | 1406311335540 |
oct | 243775257716 |
9 | 62728535673 |
10 | 22011011022 |
11 | 9375707400 |
12 | 4323539726 |
13 | 20ca208aa0 |
14 | 10cb409690 |
15 | 88c5a609c |
hex | 51ff55fce |
22011011022 has 192 divisors, whose sum is σ = 59798979072. Its totient is φ = 5255712000.
The previous prime is 22011010999. The next prime is 22011011083.
22011011022 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 22011010989 and 22011011007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 20942397 + ... + 20943447.
It is an arithmetic number, because the mean of its divisors is an integer number (311453016).
Almost surely, 222011011022 is an apocalyptic number.
22011011022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 22011011022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29899489536).
22011011022 is an abundant number, since it is smaller than the sum of its proper divisors (37787968050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22011011022 is a wasteful number, since it uses less digits than its factorization.
22011011022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1415 (or 1404 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
It can be divided in two parts, 220110 and 11022, that added together give a palindrome (231132).
The spelling of 22011011022 in words is "twenty-two billion, eleven million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.998 sec. • engine limits •