Base | Representation |
---|---|
bin | 1010000000100110101011… |
… | …11101100110101110001101 |
3 | 2212221020020120202000110112 |
4 | 11000103111331212232031 |
5 | 10341112013020333401 |
6 | 114451414220445405 |
7 | 4431146103015530 |
oct | 500232575465615 |
9 | 85836216660415 |
10 | 22011002121101 |
11 | 70168a4965294 |
12 | 2575a680a9865 |
13 | c38823036026 |
14 | 5614a3db0a17 |
15 | 282853bc13bb |
hex | 1404d5f66b8d |
22011002121101 has 32 divisors (see below), whose sum is σ = 26671517429760. Its totient is φ = 17732550756096.
The previous prime is 22011002121077. The next prime is 22011002121181. The reversal of 22011002121101 is 10112120011022.
It is a cyclic number.
It is not a de Polignac number, because 22011002121101 - 230 = 22009928379277 is a prime.
It is a super-2 number, since 2×220110021211012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011002121181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 353122400 + ... + 353184726.
It is an arithmetic number, because the mean of its divisors is an integer number (833484919680).
Almost surely, 222011002121101 is an apocalyptic number.
It is an amenable number.
22011002121101 is a deficient number, since it is larger than the sum of its proper divisors (4660515308659).
22011002121101 is a wasteful number, since it uses less digits than its factorization.
22011002121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66353.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 22011002121101 its reverse (10112120011022), we get a palindrome (32123122132123).
The spelling of 22011002121101 in words is "twenty-two trillion, eleven billion, two million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •