Base | Representation |
---|---|
bin | 101111110001100001000111… |
… | …101001100101000000000111 |
3 | 1000112221102020000002102121212 |
4 | 233301201013221211000013 |
5 | 210014424313030431434 |
6 | 2022511354545002035 |
7 | 62154006335064464 |
oct | 5761410751450007 |
9 | 1015842200072555 |
10 | 210111002202119 |
11 | 60a47637184797 |
12 | 1b694b0562331b |
13 | 90314c84428b5 |
14 | 39c55d909866b |
15 | 19457090938ce |
hex | bf1847a65007 |
210111002202119 has 2 divisors, whose sum is σ = 210111002202120. Its totient is φ = 210111002202118.
The previous prime is 210111002202113. The next prime is 210111002202121. The reversal of 210111002202119 is 911202200111012.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210111002202119 is a prime.
It is a super-2 number, since 2×2101110022021192 (a number of 29 digits) contains 22 as substring.
Together with 210111002202121, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 210111002202094 and 210111002202103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210111002202113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105055501101059 + 105055501101060.
It is an arithmetic number, because the mean of its divisors is an integer number (105055501101060).
Almost surely, 2210111002202119 is an apocalyptic number.
210111002202119 is a deficient number, since it is larger than the sum of its proper divisors (1).
210111002202119 is an equidigital number, since it uses as much as digits as its factorization.
210111002202119 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 210111002202119 in words is "two hundred ten trillion, one hundred eleven billion, two million, two hundred two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •