Base | Representation |
---|---|
bin | 101101101101000110000110… |
… | …100000100110001110010010 |
3 | 222100201110120200012222210120 |
4 | 231231012012200212032102 |
5 | 202321331032401042320 |
6 | 1551303104400411110 |
7 | 60224365330060161 |
oct | 5555060640461622 |
9 | 870643520188716 |
10 | 201011021112210 |
11 | 59059328086a41 |
12 | 1a665348316a96 |
13 | 882134796479a |
14 | 378cdb1a753d8 |
15 | 1838b58165440 |
hex | b6d186826392 |
201011021112210 has 64 divisors (see below), whose sum is σ = 506006812104192. Its totient is φ = 51044546808576.
The previous prime is 201011021112203. The next prime is 201011021112227. The reversal of 201011021112210 is 12211120110102.
It is a happy number.
It is a super-2 number, since 2×2010110211122102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 201011021112210.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1926447937 + ... + 1926552276.
It is an arithmetic number, because the mean of its divisors is an integer number (7906356439128).
Almost surely, 2201011021112210 is an apocalyptic number.
201011021112210 is an abundant number, since it is smaller than the sum of its proper divisors (304995790991982).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201011021112210 is a wasteful number, since it uses less digits than its factorization.
201011021112210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3853000307.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201011021112210 its reverse (12211120110102), we get a palindrome (213222141222312).
The spelling of 201011021112210 in words is "two hundred one trillion, eleven billion, twenty-one million, one hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •