Base | Representation |
---|---|
bin | 1010111011110001110110… |
… | …0110001001110000100011 |
3 | 1120120022011111221120221020 |
4 | 2232330131212021300203 |
5 | 3033432240130032321 |
6 | 41322514152100523 |
7 | 2350366043642241 |
oct | 256743546116043 |
9 | 46508144846836 |
10 | 12022110002211 |
11 | 3915603753801 |
12 | 1421b70394743 |
13 | 6928ac277c2a |
14 | 2d7c321d5791 |
15 | 15cac902c4c6 |
hex | aef1d989c23 |
12022110002211 has 8 divisors (see below), whose sum is σ = 16035227407440. Its totient is φ = 8011866299232.
The previous prime is 12022110002207. The next prime is 12022110002213. The reversal of 12022110002211 is 11220001122021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12022110002211 - 22 = 12022110002207 is a prime.
It is a super-2 number, since 2×120221100022112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12022110002213) 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 7 ways as a sum of consecutive naturals, for example, 718415800 + ... + 718432533.
It is an arithmetic number, because the mean of its divisors is an integer number (2004403425930).
Almost surely, 212022110002211 is an apocalyptic number.
12022110002211 is a deficient number, since it is larger than the sum of its proper divisors (4013117405229).
12022110002211 is a wasteful number, since it uses less digits than its factorization.
12022110002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1436851125.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12022110002211 its reverse (11220001122021), we get a palindrome (23242111124232).
The spelling of 12022110002211 in words is "twelve trillion, twenty-two billion, one hundred ten million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •