Base | Representation |
---|---|
bin | 101101101110011010111011… |
… | …010110111101010111001011 |
3 | 222101001011200021011010100012 |
4 | 231232122323112331113023 |
5 | 202324324101113404321 |
6 | 1551413010314102135 |
7 | 60234101363446046 |
oct | 5556327326752713 |
9 | 871034607133305 |
10 | 201102102091211 |
11 | 59093a16a00602 |
12 | 1a67ab2711a94b |
13 | 8829b01707ab9 |
14 | 379357235dc5d |
15 | 183b1d936c05b |
hex | b6e6bb5bd5cb |
201102102091211 has 2 divisors, whose sum is σ = 201102102091212. Its totient is φ = 201102102091210.
The previous prime is 201102102091199. The next prime is 201102102091271. The reversal of 201102102091211 is 112190201201102.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201102102091211 - 26 = 201102102091147 is a prime.
It is not a weakly prime, because it can be changed into another prime (201102102091271) 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, 100551051045605 + 100551051045606.
It is an arithmetic number, because the mean of its divisors is an integer number (100551051045606).
Almost surely, 2201102102091211 is an apocalyptic number.
201102102091211 is a deficient number, since it is larger than the sum of its proper divisors (1).
201102102091211 is an equidigital number, since it uses as much as digits as its factorization.
201102102091211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 23.
Adding to 201102102091211 its reverse (112190201201102), we get a palindrome (313292303292313).
The spelling of 201102102091211 in words is "two hundred one trillion, one hundred two billion, one hundred two million, ninety-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •