Base | Representation |
---|---|
bin | 11001100000111001101010… |
… | …111101111101010101101101 |
3 | 112201022101001220011022221202 |
4 | 121200321222331331111231 |
5 | 104201440400202432341 |
6 | 1034353310510335245 |
7 | 32431025461141631 |
oct | 3140715275752555 |
9 | 481271056138852 |
10 | 112212110202221 |
11 | 32832985933367 |
12 | 107035607ba525 |
13 | 4a7c730a92913 |
14 | 1d9d148db8dc1 |
15 | ce8d63e0279b |
hex | 660e6af7d56d |
112212110202221 has 32 divisors (see below), whose sum is σ = 122709370176000. Its totient is φ = 102262073030208.
The previous prime is 112212110202211. The next prime is 112212110202233. The reversal of 112212110202221 is 122202011212211.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112212110202221 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 112212110202193 and 112212110202202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112212110202211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20025866 + ... + 25009188.
It is an arithmetic number, because the mean of its divisors is an integer number (3834667818000).
Almost surely, 2112212110202221 is an apocalyptic number.
It is an amenable number.
112212110202221 is a deficient number, since it is larger than the sum of its proper divisors (10497259973779).
112212110202221 is a wasteful number, since it uses less digits than its factorization.
112212110202221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4983833.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 112212110202221 its reverse (122202011212211), we get a palindrome (234414121414432).
The spelling of 112212110202221 in words is "one hundred twelve trillion, two hundred twelve billion, one hundred ten million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •