Base | Representation |
---|---|
bin | 101101101111111000001010… |
… | …111110100001010111101111 |
3 | 222101101202002210122001200022 |
4 | 231233320022332201113233 |
5 | 202332444122330011231 |
6 | 1551531005205352355 |
7 | 60244244425535111 |
oct | 5557701276412757 |
9 | 871352083561608 |
10 | 201202222110191 |
11 | 59122424060745 |
12 | 1a6964091086bb |
13 | 8836399049c93 |
14 | 379834d3033b1 |
15 | 183dae8db2c7b |
hex | b6fe0afa15ef |
201202222110191 has 2 divisors, whose sum is σ = 201202222110192. Its totient is φ = 201202222110190.
The previous prime is 201202222110091. The next prime is 201202222110193. The reversal of 201202222110191 is 191011222202102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201202222110191 is a prime.
Together with 201202222110193, 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 201202222110191.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201202222110193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100601111055095 + 100601111055096.
It is an arithmetic number, because the mean of its divisors is an integer number (100601111055096).
Almost surely, 2201202222110191 is an apocalyptic number.
201202222110191 is a deficient number, since it is larger than the sum of its proper divisors (1).
201202222110191 is an equidigital number, since it uses as much as digits as its factorization.
201202222110191 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 26.
Adding to 201202222110191 its reverse (191011222202102), we get a palindrome (392213444312293).
The spelling of 201202222110191 in words is "two hundred one trillion, two hundred two billion, two hundred twenty-two million, one hundred ten thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •