Base | Representation |
---|---|
bin | 1011101110000011110… |
… | …0101100010101000011 |
3 | 201020200220102212022112 |
4 | 2323200330230111003 |
5 | 11244322140032321 |
6 | 232255004325535 |
7 | 20355312013424 |
oct | 2734074542503 |
9 | 636626385275 |
10 | 201342502211 |
11 | 78430658a64 |
12 | 330312438ab |
13 | 15ca94b8896 |
14 | 9a6050764b |
15 | 538625ca5b |
hex | 2ee0f2c543 |
201342502211 has 2 divisors, whose sum is σ = 201342502212. Its totient is φ = 201342502210.
The previous prime is 201342502121. The next prime is 201342502243. The reversal of 201342502211 is 112205243102.
201342502211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (201342502121) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201342502211 - 210 = 201342501187 is a prime.
It is not a weakly prime, because it can be changed into another prime (201342522211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100671251105 + 100671251106.
It is an arithmetic number, because the mean of its divisors is an integer number (100671251106).
Almost surely, 2201342502211 is an apocalyptic number.
201342502211 is a deficient number, since it is larger than the sum of its proper divisors (1).
201342502211 is an equidigital number, since it uses as much as digits as its factorization.
201342502211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 201342502211 its reverse (112205243102), we get a palindrome (313547745313).
The spelling of 201342502211 in words is "two hundred one billion, three hundred forty-two million, five hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •