Base | Representation |
---|---|
bin | 11101001000100001001… |
… | …011000010000101110101 |
3 | 21002101112121110111011120 |
4 | 131020201023002011311 |
5 | 230300104343101323 |
6 | 4131413350054153 |
7 | 264432464163051 |
oct | 35104113020565 |
9 | 7071477414146 |
10 | 2002011300213 |
11 | 702059206471 |
12 | 28400564a359 |
13 | 116a34167042 |
14 | 6cc7da4ac61 |
15 | 371248735e3 |
hex | 1d2212c2175 |
2002011300213 has 8 divisors (see below), whose sum is σ = 2671141118400. Its totient is φ = 1333777841088.
The previous prime is 2002011300169. The next prime is 2002011300239. The reversal of 2002011300213 is 3120031102002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2002011300213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2002011300192 and 2002011300201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002011300293) 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 in 7 ways as a sum of consecutive naturals, for example, 224084553 + ... + 224093486.
It is an arithmetic number, because the mean of its divisors is an integer number (333892639800).
Almost surely, 22002011300213 is an apocalyptic number.
It is an amenable number.
2002011300213 is a deficient number, since it is larger than the sum of its proper divisors (669129818187).
2002011300213 is a wasteful number, since it uses less digits than its factorization.
2002011300213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448179531.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 2002011300213 its reverse (3120031102002), we get a palindrome (5122042402215).
The spelling of 2002011300213 in words is "two trillion, two billion, eleven million, three hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •