Base | Representation |
---|---|
bin | 11101001001001001101… |
… | …101010100111100000111 |
3 | 21002110022000011001210222 |
4 | 131021021231110330013 |
5 | 230303002443111301 |
6 | 4132005042334555 |
7 | 264455362563644 |
oct | 35111155247407 |
9 | 7073260131728 |
10 | 2002691378951 |
11 | 70237808970a |
12 | 28417535a45b |
13 | 116b1201cab3 |
14 | 6cd060badcb |
15 | 3716440d31b |
hex | 1d249b54f07 |
2002691378951 has 2 divisors, whose sum is σ = 2002691378952. Its totient is φ = 2002691378950.
The previous prime is 2002691378911. The next prime is 2002691378953. The reversal of 2002691378951 is 1598731962002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2002691378951 - 26 = 2002691378887 is a prime.
Together with 2002691378953, 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 = 2002691378893 and 2002691378902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002691378953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001345689475 + 1001345689476.
It is an arithmetic number, because the mean of its divisors is an integer number (1001345689476).
Almost surely, 22002691378951 is an apocalyptic number.
2002691378951 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002691378951 is an equidigital number, since it uses as much as digits as its factorization.
2002691378951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 53.
The spelling of 2002691378951 in words is "two trillion, two billion, six hundred ninety-one million, three hundred seventy-eight thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •