Base | Representation |
---|---|
bin | 110000001101001010101110… |
… | …111101011111101000110111 |
3 | 1000210200001201212001111221021 |
4 | 300031022232331133220313 |
5 | 210242042223410133421 |
6 | 2030524320531202011 |
7 | 62441203654416553 |
oct | 6015125675375067 |
9 | 1023601655044837 |
10 | 212011111021111 |
11 | 6160a453064826 |
12 | 1b941210146307 |
13 | 913b73c8a816c |
14 | 3a4d56d132863 |
15 | 1979d6767e341 |
hex | c0d2aef5fa37 |
212011111021111 has 2 divisors, whose sum is σ = 212011111021112. Its totient is φ = 212011111021110.
The previous prime is 212011111021069. The next prime is 212011111021117. The reversal of 212011111021111 is 111120111110212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212011111021111 - 217 = 212011110890039 is a prime.
It is a super-2 number, since 2×2120111110211112 (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 (212011111021117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106005555510555 + 106005555510556.
It is an arithmetic number, because the mean of its divisors is an integer number (106005555510556).
Almost surely, 2212011111021111 is an apocalyptic number.
212011111021111 is a deficient number, since it is larger than the sum of its proper divisors (1).
212011111021111 is an equidigital number, since it uses as much as digits as its factorization.
212011111021111 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 16.
Adding to 212011111021111 its reverse (111120111110212), we get a palindrome (323131222131323).
It can be divided in two parts, 21201111 and 1021111, that added together give a palindrome (22222222).
The spelling of 212011111021111 in words is "two hundred twelve trillion, eleven billion, one hundred eleven million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •