Base | Representation |
---|---|
bin | 110000001111111010101001… |
… | …101011111101110100110111 |
3 | 1000211100010021221001210022011 |
4 | 300033322221223331310313 |
5 | 210303141100240213421 |
6 | 2031151200145145051 |
7 | 62460641562541342 |
oct | 6017725153756467 |
9 | 1024303257053264 |
10 | 212200001101111 |
11 | 61682573640661 |
12 | 1b97194702b187 |
13 | 91534b3294b7a |
14 | 3a5876b8cd459 |
15 | 197ec205a04e1 |
hex | c0fea9afdd37 |
212200001101111 has 2 divisors, whose sum is σ = 212200001101112. Its totient is φ = 212200001101110.
The previous prime is 212200001101063. The next prime is 212200001101157. The reversal of 212200001101111 is 111101100002212.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212200001101111 - 217 = 212200000970039 is a prime.
It is a super-2 number, since 2×2122000011011112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212200001101091 and 212200001101100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212200001101511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106100000550555 + 106100000550556.
It is an arithmetic number, because the mean of its divisors is an integer number (106100000550556).
Almost surely, 2212200001101111 is an apocalyptic number.
212200001101111 is a deficient number, since it is larger than the sum of its proper divisors (1).
212200001101111 is an equidigital number, since it uses as much as digits as its factorization.
212200001101111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 212200001101111 its reverse (111101100002212), we get a palindrome (323301101103323).
The spelling of 212200001101111 in words is "two hundred twelve trillion, two hundred billion, one million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •