Base | Representation |
---|---|
bin | 1011000111011010100010… |
… | …0100001101100011011111 |
3 | 1121021102010220002202111222 |
4 | 2301312220210031203133 |
5 | 3100221134031201421 |
6 | 41554414111203555 |
7 | 2401003542036131 |
oct | 261665044154337 |
9 | 47242126082458 |
10 | 12222010022111 |
11 | 399236403741a |
12 | 145485a5165bb |
13 | 6a86b895c686 |
14 | 303796ccd051 |
15 | 162dc8802cab |
hex | b1da890d8df |
12222010022111 has 2 divisors, whose sum is σ = 12222010022112. Its totient is φ = 12222010022110.
The previous prime is 12222010022099. The next prime is 12222010022113. The reversal of 12222010022111 is 11122001022221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12222010022111 - 222 = 12222005827807 is a prime.
Together with 12222010022113, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12222010022111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12222010022113) 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 as a sum of consecutive naturals, namely, 6111005011055 + 6111005011056.
It is an arithmetic number, because the mean of its divisors is an integer number (6111005011056).
Almost surely, 212222010022111 is an apocalyptic number.
12222010022111 is a deficient number, since it is larger than the sum of its proper divisors (1).
12222010022111 is an equidigital number, since it uses as much as digits as its factorization.
12222010022111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12222010022111 its reverse (11122001022221), we get a palindrome (23344011044332).
The spelling of 12222010022111 in words is "twelve trillion, two hundred twenty-two billion, ten million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •