Base | Representation |
---|---|
bin | 1010000000010100000110… |
… | …00011000100011111001101 |
3 | 2212220021110222201010111220 |
4 | 11000022003003010133031 |
5 | 10340431042401011341 |
6 | 114443043553033553 |
7 | 4430343545562456 |
oct | 500120303043715 |
9 | 85807428633456 |
10 | 22001021110221 |
11 | 701264294006a |
12 | 2573b415558b9 |
13 | c378c2266b2a |
14 | 560bd859212d |
15 | 28246c814a66 |
hex | 1402830c47cd |
22001021110221 has 32 divisors (see below), whose sum is σ = 31644381162240. Its totient is φ = 13561877260800.
The previous prime is 22001021110163. The next prime is 22001021110241. The reversal of 22001021110221 is 12201112010022.
It is not a de Polignac number, because 22001021110221 - 217 = 22001020979149 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22001021110221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22001021110241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35365770 + ... + 35982491.
It is an arithmetic number, because the mean of its divisors is an integer number (988886911320).
Almost surely, 222001021110221 is an apocalyptic number.
It is an amenable number.
22001021110221 is a deficient number, since it is larger than the sum of its proper divisors (9643360052019).
22001021110221 is a wasteful number, since it uses less digits than its factorization.
22001021110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71348437.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22001021110221 its reverse (12201112010022), we get a palindrome (34202133120243).
The spelling of 22001021110221 in words is "twenty-two trillion, one billion, twenty-one million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •