Base | Representation |
---|---|
bin | 10100011111011011… |
… | …101111000110111100 |
3 | 2002210101000121201002 |
4 | 110133123233012330 |
5 | 330030030413040 |
6 | 14035131305432 |
7 | 1406143423442 |
oct | 243733570674 |
9 | 62711017632 |
10 | 22002201020 |
11 | 937073a308 |
12 | 43205ab278 |
13 | 20c8442a77 |
14 | 10ca194b92 |
15 | 88b915a15 |
hex | 51f6ef1bc |
22002201020 has 192 divisors, whose sum is σ = 51903344640. Its totient is φ = 7800883200.
The previous prime is 22002201007. The next prime is 22002201041. The reversal of 22002201020 is 2010220022.
It is a junction number, because it is equal to n+sod(n) for n = 22002200992 and 22002201010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 48144632 + ... + 48145088.
It is an arithmetic number, because the mean of its divisors is an integer number (270329920).
Almost surely, 222002201020 is an apocalyptic number.
22002201020 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 22002201020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25951672320).
22002201020 is an abundant number, since it is smaller than the sum of its proper divisors (29901143620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22002201020 is a wasteful number, since it uses less digits than its factorization.
22002201020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 644 (or 642 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 11.
Adding to 22002201020 its reverse (2010220022), we get a palindrome (24012421042).
The spelling of 22002201020 in words is "twenty-two billion, two million, two hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •