Base | Representation |
---|---|
bin | 11101000111110111100… |
… | …100000000000000100101 |
3 | 21002022201221212102202002 |
4 | 131013313210000000211 |
5 | 230242142134432323 |
6 | 4131220211255045 |
7 | 264406256352653 |
oct | 35076744000045 |
9 | 7068657772662 |
10 | 2001313202213 |
11 | 701830146076 |
12 | 283a4b8aa485 |
13 | 1169526425c0 |
14 | 6cc15049dd3 |
15 | 370d3429828 |
hex | 1d1f7900025 |
2001313202213 has 8 divisors (see below), whose sum is σ = 2164754913888. Its totient is φ = 1839227853744.
The previous prime is 2001313202197. The next prime is 2001313202347. The reversal of 2001313202213 is 3122023131002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2001313202213 - 24 = 2001313202197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001313202513) 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, 339087731 + ... + 339093632.
It is an arithmetic number, because the mean of its divisors is an integer number (270594364236).
Almost surely, 22001313202213 is an apocalyptic number.
It is an amenable number.
2001313202213 is a deficient number, since it is larger than the sum of its proper divisors (163441711675).
2001313202213 is a wasteful number, since it uses less digits than its factorization.
2001313202213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 678181603.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2001313202213 its reverse (3122023131002), we get a palindrome (5123336333215).
The spelling of 2001313202213 in words is "two trillion, one billion, three hundred thirteen million, two hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •