Base | Representation |
---|---|
bin | 11101001111111110100… |
… | …010100100001011111101 |
3 | 21010011012202121210221112 |
4 | 131033332202210023331 |
5 | 230413010132414323 |
6 | 4135220204411405 |
7 | 265135113544463 |
oct | 35177642441375 |
9 | 7104182553845 |
10 | 2010020201213 |
11 | 705499003312 |
12 | 28567b846b65 |
13 | 11770c4a570b |
14 | 6d3dd590833 |
15 | 37442a2b178 |
hex | 1d3fe8a42fd |
2010020201213 has 4 divisors (see below), whose sum is σ = 2010492817788. Its totient is φ = 2009547584640.
The previous prime is 2010020201159. The next prime is 2010020201239. The reversal of 2010020201213 is 3121020200102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 642142590244 + 1367877610969 = 801338^2 + 1169563^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010020201213 - 26 = 2010020201149 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 (2010020101213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 236301908 + ... + 236310413.
It is an arithmetic number, because the mean of its divisors is an integer number (502623204447).
Almost surely, 22010020201213 is an apocalyptic number.
It is an amenable number.
2010020201213 is a deficient number, since it is larger than the sum of its proper divisors (472616575).
2010020201213 is an equidigital number, since it uses as much as digits as its factorization.
2010020201213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472616574.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 2010020201213 its reverse (3121020200102), we get a palindrome (5131040401315).
The spelling of 2010020201213 in words is "two trillion, ten billion, twenty million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •