Base | Representation |
---|---|
bin | 1001010001110010000110… |
… | …0111000000000111010011 |
3 | 1100010012211222102202110011 |
4 | 2110130201213000013103 |
5 | 2314113333431401321 |
6 | 33410154212015351 |
7 | 2102002021343131 |
oct | 224344147000723 |
9 | 40105758382404 |
10 | 10201111200211 |
11 | 32832a336a3a8 |
12 | 1189063601557 |
13 | 58cc6474a2c9 |
14 | 273a44a26751 |
15 | 12a54ac11ae1 |
hex | 947219c01d3 |
10201111200211 has 8 divisors (see below), whose sum is σ = 10368452132048. Its totient is φ = 10033773804000.
The previous prime is 10201111200193. The next prime is 10201111200239. The reversal of 10201111200211 is 11200211110201.
It is a happy number.
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 10201111200211 - 219 = 10201110675923 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10201111200191 and 10201111200200.
It is not an unprimeable number, because it can be changed into a prime (10201111200811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5284021 + ... + 6951481.
It is an arithmetic number, because the mean of its divisors is an integer number (1296056516506).
Almost surely, 210201111200211 is an apocalyptic number.
10201111200211 is a deficient number, since it is larger than the sum of its proper divisors (167340931837).
10201111200211 is a wasteful number, since it uses less digits than its factorization.
10201111200211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1767813.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10201111200211 its reverse (11200211110201), we get a palindrome (21401322310412).
The spelling of 10201111200211 in words is "ten trillion, two hundred one billion, one hundred eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •