Base | Representation |
---|---|
bin | 11101001000110100001… |
… | …011100101101010100111 |
3 | 21002102100211112221022102 |
4 | 131020310023211222213 |
5 | 230301233013304111 |
6 | 4131505141322315 |
7 | 264443415663041 |
oct | 35106413455247 |
9 | 7072324487272 |
10 | 2002330213031 |
11 | 702202228385 |
12 | 28409440639b |
13 | 116a85257455 |
14 | 6ccb0144a91 |
15 | 3714286b13b |
hex | 1d2342e5aa7 |
2002330213031 has 2 divisors, whose sum is σ = 2002330213032. Its totient is φ = 2002330213030.
The previous prime is 2002330213019. The next prime is 2002330213033. The reversal of 2002330213031 is 1303120332002.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002330213031 is a prime.
It is a super-2 number, since 2×20023302130312 (a number of 25 digits) contains 22 as substring.
Together with 2002330213033, 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 = 2002330212994 and 2002330213012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002330213033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001165106515 + 1001165106516.
It is an arithmetic number, because the mean of its divisors is an integer number (1001165106516).
Almost surely, 22002330213031 is an apocalyptic number.
2002330213031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002330213031 is an equidigital number, since it uses as much as digits as its factorization.
2002330213031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 2002330213031 its reverse (1303120332002), we get a palindrome (3305450545033).
The spelling of 2002330213031 in words is "two trillion, two billion, three hundred thirty million, two hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •