Base | Representation |
---|---|
bin | 110000001111111011110001… |
… | …101111100011001011101111 |
3 | 1000211100020102011211012222012 |
4 | 300033323301233203023233 |
5 | 210303201034230000421 |
6 | 2031151520132111435 |
7 | 62461013542162253 |
oct | 6017736157431357 |
9 | 1024306364735865 |
10 | 212201210000111 |
11 | 61683033a75342 |
12 | 1b972023a6557b |
13 | 9153646883a17 |
14 | 3a58844298263 |
15 | 197ec9179795b |
hex | c0fef1be32ef |
212201210000111 has 2 divisors, whose sum is σ = 212201210000112. Its totient is φ = 212201210000110.
The previous prime is 212201210000099. The next prime is 212201210000113. The reversal of 212201210000111 is 111000012102212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212201210000111 - 210 = 212201209999087 is a prime.
It is a super-2 number, since 2×2122012100001112 (a number of 29 digits) contains 22 as substring.
Together with 212201210000113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212201210000113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106100605000055 + 106100605000056.
It is an arithmetic number, because the mean of its divisors is an integer number (106100605000056).
Almost surely, 2212201210000111 is an apocalyptic number.
212201210000111 is a deficient number, since it is larger than the sum of its proper divisors (1).
212201210000111 is an equidigital number, since it uses as much as digits as its factorization.
212201210000111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 212201210000111 its reverse (111000012102212), we get a palindrome (323201222102323).
The spelling of 212201210000111 in words is "two hundred twelve trillion, two hundred one billion, two hundred ten million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •