Base | Representation |
---|---|
bin | 101101101110011010110110… |
… | …011110001100011111011111 |
3 | 222101001011110112212122102212 |
4 | 231232122312132030133133 |
5 | 202324323414121231421 |
6 | 1551412554224511035 |
7 | 60234066346526552 |
oct | 5556326636143737 |
9 | 871034415778385 |
10 | 201102020102111 |
11 | 590939846a0a17 |
12 | 1a67ab0377b47b |
13 | 8829aba72c23b |
14 | 37935654da699 |
15 | 183b1d2073e5b |
hex | b6e6b678c7df |
201102020102111 has 2 divisors, whose sum is σ = 201102020102112. Its totient is φ = 201102020102110.
The previous prime is 201102020102107. The next prime is 201102020102239. The reversal of 201102020102111 is 111201020201102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201102020102111 - 22 = 201102020102107 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201102020302111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100551010051055 + 100551010051056.
It is an arithmetic number, because the mean of its divisors is an integer number (100551010051056).
Almost surely, 2201102020102111 is an apocalyptic number.
201102020102111 is a deficient number, since it is larger than the sum of its proper divisors (1).
201102020102111 is an equidigital number, since it uses as much as digits as its factorization.
201102020102111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201102020102111 its reverse (111201020201102), we get a palindrome (312303040303213).
The spelling of 201102020102111 in words is "two hundred one trillion, one hundred two billion, twenty million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •