Base | Representation |
---|---|
bin | 101101101110101100101110… |
… | …111100100111001111100111 |
3 | 222101010000000201011001021001 |
4 | 231232230232330213033213 |
5 | 202330132230112223421 |
6 | 1551425451415134131 |
7 | 60235346231336305 |
oct | 5556545674471747 |
9 | 871100021131231 |
10 | 201121221211111 |
11 | 590a1038177343 |
12 | 1a682782074347 |
13 | 882b85a7519b6 |
14 | 3794467665275 |
15 | 183b957ad6691 |
hex | b6eb2ef273e7 |
201121221211111 has 2 divisors, whose sum is σ = 201121221211112. Its totient is φ = 201121221211110.
The previous prime is 201121221211093. The next prime is 201121221211123. The reversal of 201121221211111 is 111112122121102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201121221211111 - 213 = 201121221202919 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201121221211181) 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, 100560610605555 + 100560610605556.
It is an arithmetic number, because the mean of its divisors is an integer number (100560610605556).
Almost surely, 2201121221211111 is an apocalyptic number.
201121221211111 is a deficient number, since it is larger than the sum of its proper divisors (1).
201121221211111 is an equidigital number, since it uses as much as digits as its factorization.
201121221211111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 201121221211111 its reverse (111112122121102), we get a palindrome (312233343332213).
Subtracting from 201121221211111 its reverse (111112122121102), we obtain a palindrome (90009099090009).
The spelling of 201121221211111 in words is "two hundred one trillion, one hundred twenty-one billion, two hundred twenty-one million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •