Base | Representation |
---|---|
bin | 101101101110101100101000… |
… | …111111001000111011111111 |
3 | 222101002222202201222110200022 |
4 | 231232230220333020323333 |
5 | 202330132024012210421 |
6 | 1551425433443522355 |
7 | 60235343605341224 |
oct | 5556545077107377 |
9 | 871088681873608 |
10 | 201121121210111 |
11 | 590a0a96785093 |
12 | 1a6827546893bb |
13 | 882b842b0a8cb |
14 | 379445827394b |
15 | 183b94de317ab |
hex | b6eb28fc8eff |
201121121210111 has 2 divisors, whose sum is σ = 201121121210112. Its totient is φ = 201121121210110.
The previous prime is 201121121210101. The next prime is 201121121210129. The reversal of 201121121210111 is 111012121121102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201121121210111 - 210 = 201121121209087 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201121121210111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201121121210101) 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, 100560560605055 + 100560560605056.
It is an arithmetic number, because the mean of its divisors is an integer number (100560560605056).
Almost surely, 2201121121210111 is an apocalyptic number.
201121121210111 is a deficient number, since it is larger than the sum of its proper divisors (1).
201121121210111 is an equidigital number, since it uses as much as digits as its factorization.
201121121210111 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 17.
Adding to 201121121210111 its reverse (111012121121102), we get a palindrome (312133242331213).
The spelling of 201121121210111 in words is "two hundred one trillion, one hundred twenty-one billion, one hundred twenty-one million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •