Base | Representation |
---|---|
bin | 11101001000101100100… |
… | …011011010101101011111 |
3 | 21002102000220202022220102 |
4 | 131020230203122231133 |
5 | 230301002233220022 |
6 | 4131444330411315 |
7 | 264440303152241 |
oct | 35105443325537 |
9 | 7072026668812 |
10 | 2002202241887 |
11 | 702146a71801 |
12 | 284059590b3b |
13 | 116a6489c293 |
14 | 6cc9b152091 |
15 | 371364dda92 |
hex | 1d22c8dab5f |
2002202241887 has 2 divisors, whose sum is σ = 2002202241888. Its totient is φ = 2002202241886.
The previous prime is 2002202241869. The next prime is 2002202241889. The reversal of 2002202241887 is 7881422022002.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002202241887 is a prime.
Together with 2002202241889, 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 2002202241887.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002202241889) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001101120943 + 1001101120944.
It is an arithmetic number, because the mean of its divisors is an integer number (1001101120944).
Almost surely, 22002202241887 is an apocalyptic number.
2002202241887 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002202241887 is an equidigital number, since it uses as much as digits as its factorization.
2002202241887 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57344, while the sum is 38.
Adding to 2002202241887 its reverse (7881422022002), we get a palindrome (9883624263889).
The spelling of 2002202241887 in words is "two trillion, two billion, two hundred two million, two hundred forty-one thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •