Base | Representation |
---|---|
bin | 11101001001001110001… |
… | …011110111000111100011 |
3 | 21002110111020111012201121 |
4 | 131021032023313013203 |
5 | 230303131210222011 |
6 | 4132020324313111 |
7 | 264460264204546 |
oct | 35111613670743 |
9 | 7073436435647 |
10 | 2002766492131 |
11 | 702406522319 |
12 | 284196542797 |
13 | 116b2475ba72 |
14 | 6cd1207085d |
15 | 3716ace8e71 |
hex | 1d24e2f71e3 |
2002766492131 has 2 divisors, whose sum is σ = 2002766492132. Its totient is φ = 2002766492130.
The previous prime is 2002766492071. The next prime is 2002766492147. The reversal of 2002766492131 is 1312946672002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2002766492131 - 221 = 2002764394979 is a prime.
It is a super-2 number, since 2×20027664921312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2002766495131) 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, 1001383246065 + 1001383246066.
It is an arithmetic number, because the mean of its divisors is an integer number (1001383246066).
Almost surely, 22002766492131 is an apocalyptic number.
2002766492131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002766492131 is an equidigital number, since it uses as much as digits as its factorization.
2002766492131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 43.
The spelling of 2002766492131 in words is "two trillion, two billion, seven hundred sixty-six million, four hundred ninety-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •