Base | Representation |
---|---|
bin | 101101101111111111011010… |
… | …101100110101001101110111 |
3 | 222101102111012000001112212011 |
4 | 231233333122230311031313 |
5 | 202333111041014213421 |
6 | 1551534333205505051 |
7 | 60244641265423303 |
oct | 5557773254651567 |
9 | 871374160045764 |
10 | 201210002101111 |
11 | 5912575671a003 |
12 | 1a697a1a712187 |
13 | 8837038b1b4c3 |
14 | 379888a69ad03 |
15 | 183de01e004e1 |
hex | b6ffdab35377 |
201210002101111 has 2 divisors, whose sum is σ = 201210002101112. Its totient is φ = 201210002101110.
The previous prime is 201210002101103. The next prime is 201210002101123. The reversal of 201210002101111 is 111101200012102.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201210002101111 - 23 = 201210002101103 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201210002101091 and 201210002101100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201210002107111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100605001050555 + 100605001050556.
It is an arithmetic number, because the mean of its divisors is an integer number (100605001050556).
Almost surely, 2201210002101111 is an apocalyptic number.
201210002101111 is a deficient number, since it is larger than the sum of its proper divisors (1).
201210002101111 is an equidigital number, since it uses as much as digits as its factorization.
201210002101111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201210002101111 its reverse (111101200012102), we get a palindrome (312311202113213).
The spelling of 201210002101111 in words is "two hundred one trillion, two hundred ten billion, two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •