Base | Representation |
---|---|
bin | 101111111111111011001001… |
… | …010111100111100010111111 |
3 | 1000200110001122010010202200211 |
4 | 233333323021113213202333 |
5 | 210132134342334310421 |
6 | 2024550245323533251 |
7 | 62315355044104411 |
oct | 5777731127474277 |
9 | 1020401563122624 |
10 | 211101021010111 |
11 | 61299492a71371 |
12 | 1b81496098a227 |
13 | 90a39828a795b |
14 | 3a1b4b5a769b1 |
15 | 196134e4149e1 |
hex | bffec95e78bf |
211101021010111 has 2 divisors, whose sum is σ = 211101021010112. Its totient is φ = 211101021010110.
The previous prime is 211101021010003. The next prime is 211101021010163. The reversal of 211101021010111 is 111010120101112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211101021010111 - 217 = 211101020879039 is a prime.
It is a super-2 number, since 2×2111010210101112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211101021010091 and 211101021010100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211101021010171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105550510505055 + 105550510505056.
It is an arithmetic number, because the mean of its divisors is an integer number (105550510505056).
Almost surely, 2211101021010111 is an apocalyptic number.
211101021010111 is a deficient number, since it is larger than the sum of its proper divisors (1).
211101021010111 is an equidigital number, since it uses as much as digits as its factorization.
211101021010111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 211101021010111 its reverse (111010120101112), we get a palindrome (322111141111223).
The spelling of 211101021010111 in words is "two hundred eleven trillion, one hundred one billion, twenty-one million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •