Base | Representation |
---|---|
bin | 110010100000001001000000… |
… | …000010000000001010001111 |
3 | 1002010102121100101111201221101 |
4 | 302200021000002000022033 |
5 | 213103031323312341421 |
6 | 2104220220222443531 |
7 | 64532663650022146 |
oct | 6240110002001217 |
9 | 1063377311451841 |
10 | 222111013012111 |
11 | 6485382a472273 |
12 | 20ab2728a335a7 |
13 | 96c1c95148912 |
14 | 3cbc33228c75d |
15 | 1aa293cdec191 |
hex | ca024008028f |
222111013012111 has 2 divisors, whose sum is σ = 222111013012112. Its totient is φ = 222111013012110.
The previous prime is 222111013012093. The next prime is 222111013012153. The reversal of 222111013012111 is 111210310111222.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 222111013012111 - 29 = 222111013011599 is a prime.
It is a super-2 number, since 2×2221110130121112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222111013112111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111055506506055 + 111055506506056.
It is an arithmetic number, because the mean of its divisors is an integer number (111055506506056).
Almost surely, 2222111013012111 is an apocalyptic number.
222111013012111 is a deficient number, since it is larger than the sum of its proper divisors (1).
222111013012111 is an equidigital number, since it uses as much as digits as its factorization.
222111013012111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 222111013012111 its reverse (111210310111222), we get a palindrome (333321323123333).
The spelling of 222111013012111 in words is "two hundred twenty-two trillion, one hundred eleven billion, thirteen million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •