Base | Representation |
---|---|
bin | 11101001000100001001… |
… | …010011000100111000011 |
3 | 21002101112121010212002202 |
4 | 131020201022120213003 |
5 | 230300104322132212 |
6 | 4131413342303415 |
7 | 264432462554516 |
oct | 35104112304703 |
9 | 7071477125082 |
10 | 2002011130307 |
11 | 7020590aa851 |
12 | 284005587b6b |
13 | 116a341078c6 |
14 | 6cc7da04d7d |
15 | 3712483d0c2 |
hex | 1d2212989c3 |
2002011130307 has 2 divisors, whose sum is σ = 2002011130308. Its totient is φ = 2002011130306.
The previous prime is 2002011130267. The next prime is 2002011130309. The reversal of 2002011130307 is 7030311102002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2002011130307 - 26 = 2002011130243 is a prime.
It is a super-3 number, since 3×20020111303073 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 2002011130309, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2002011130309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001005565153 + 1001005565154.
It is an arithmetic number, because the mean of its divisors is an integer number (1001005565154).
Almost surely, 22002011130307 is an apocalyptic number.
2002011130307 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002011130307 is an equidigital number, since it uses as much as digits as its factorization.
2002011130307 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 20.
Adding to 2002011130307 its reverse (7030311102002), we get a palindrome (9032322232309).
The spelling of 2002011130307 in words is "two trillion, two billion, eleven million, one hundred thirty thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •