Base | Representation |
---|---|
bin | 11001011101111101100011… |
… | …011110011000001100110011 |
3 | 112200121001200220212201201120 |
4 | 121131331203132120030303 |
5 | 104140133211440121321 |
6 | 1034120423401233323 |
7 | 32410315134340311 |
oct | 3135754336301463 |
9 | 480531626781646 |
10 | 112010121020211 |
11 | 32765253244297 |
12 | 1069038aa92843 |
13 | 4a6668061638b |
14 | 1d93466a570b1 |
15 | ce3991005ec6 |
hex | 65df63798333 |
112010121020211 has 8 divisors (see below), whose sum is σ = 149885986251984. Its totient is φ = 74403834900960.
The previous prime is 112010121020117. The next prime is 112010121020221. The reversal of 112010121020211 is 112020121010211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112010121020211 - 211 = 112010121018163 is a prime.
It is a super-2 number, since 2×1120101210202112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112010121020221) 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, 67394777160 + ... + 67394778821.
It is an arithmetic number, because the mean of its divisors is an integer number (18735748281498).
Almost surely, 2112010121020211 is an apocalyptic number.
112010121020211 is a deficient number, since it is larger than the sum of its proper divisors (37875865231773).
112010121020211 is a wasteful number, since it uses less digits than its factorization.
112010121020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134789556261.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112010121020211 its reverse (112020121010211), we get a palindrome (224030242030422).
The spelling of 112010121020211 in words is "one hundred twelve trillion, ten billion, one hundred twenty-one million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •