Base | Representation |
---|---|
bin | 1010000000101000100101… |
… | …01100011001010111011001 |
3 | 2212221022212120222110011021 |
4 | 11000110102230121113121 |
5 | 10341121104340120441 |
6 | 114452103255202441 |
7 | 4431213254351566 |
oct | 500242254312731 |
9 | 85838776873137 |
10 | 22012021020121 |
11 | 70172780171a0 |
12 | 25760b1376421 |
13 | c3895615c462 |
14 | 56155d43b86d |
15 | 2828b33873d1 |
hex | 140512b195d9 |
22012021020121 has 32 divisors (see below), whose sum is σ = 24141329081856. Its totient is φ = 19904417280000.
The previous prime is 22012021020001. The next prime is 22012021020127. The reversal of 22012021020121 is 12102012021022.
It is a happy number.
It is not a de Polignac number, because 22012021020121 - 217 = 22012020889049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22012021020095 and 22012021020104.
It is not an unprimeable number, because it can be changed into a prime (22012021020127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4938750525 + ... + 4938754981.
It is an arithmetic number, because the mean of its divisors is an integer number (754416533808).
Almost surely, 222012021020121 is an apocalyptic number.
It is an amenable number.
22012021020121 is a deficient number, since it is larger than the sum of its proper divisors (2129308061735).
22012021020121 is a wasteful number, since it uses less digits than its factorization.
22012021020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7713.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22012021020121 its reverse (12102012021022), we get a palindrome (34114033041143).
The spelling of 22012021020121 in words is "twenty-two trillion, twelve billion, twenty-one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •