Base | Representation |
---|---|
bin | 101101101101000111001100… |
… | …111010001000101101011111 |
3 | 222100201120121222200002101022 |
4 | 231231013030322020231133 |
5 | 202321340442231242231 |
6 | 1551303421511434355 |
7 | 60224436521210306 |
oct | 5555071472105537 |
9 | 870646558602338 |
10 | 201012202212191 |
11 | 59059883853927 |
12 | 1a6656179859bb |
13 | 88214a556c406 |
14 | 378d08488543d |
15 | 1838bc6bbac7b |
hex | b6d1cce88b5f |
201012202212191 has 2 divisors, whose sum is σ = 201012202212192. Its totient is φ = 201012202212190.
The previous prime is 201012202212149. The next prime is 201012202212193. The reversal of 201012202212191 is 191212202210102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201012202212191 - 226 = 201012135103327 is a prime.
Together with 201012202212193, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201012202212191.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201012202212193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100506101106095 + 100506101106096.
It is an arithmetic number, because the mean of its divisors is an integer number (100506101106096).
Almost surely, 2201012202212191 is an apocalyptic number.
201012202212191 is a deficient number, since it is larger than the sum of its proper divisors (1).
201012202212191 is an equidigital number, since it uses as much as digits as its factorization.
201012202212191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 26.
Adding to 201012202212191 its reverse (191212202210102), we get a palindrome (392224404422293).
The spelling of 201012202212191 in words is "two hundred one trillion, twelve billion, two hundred two million, two hundred twelve thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •