Base | Representation |
---|---|
bin | 101101101111111111011011… |
… | …001011110001011100010001 |
3 | 222101102111012120022122001122 |
4 | 231233333123023301130101 |
5 | 202333111100103241423 |
6 | 1551534334055412025 |
7 | 60244641424364450 |
oct | 5557773313613421 |
9 | 871374176278048 |
10 | 201210010212113 |
11 | 59125760259a11 |
12 | 1a697a21384015 |
13 | 883703a6cb306 |
14 | 379888b7acb97 |
15 | 183de029a38c8 |
hex | b6ffdb2f1711 |
201210010212113 has 16 divisors (see below), whose sum is σ = 234296007649920. Its totient is φ = 169209522283776.
The previous prime is 201210010212097. The next prime is 201210010212157. The reversal of 201210010212113 is 311212010012102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 201210010212113 - 24 = 201210010212097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201210010212091 and 201210010212100.
It is not an unprimeable number, because it can be changed into a prime (201210010242113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26442806 + ... + 33190992.
It is an arithmetic number, because the mean of its divisors is an integer number (14643500478120).
Almost surely, 2201210010212113 is an apocalyptic number.
It is an amenable number.
201210010212113 is a deficient number, since it is larger than the sum of its proper divisors (33085997437807).
201210010212113 is an equidigital number, since it uses as much as digits as its factorization.
201210010212113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6828616.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 201210010212113 its reverse (311212010012102), we get a palindrome (512422020224215).
The spelling of 201210010212113 in words is "two hundred one trillion, two hundred ten billion, ten million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •