Base | Representation |
---|---|
bin | 11001011101111101100010… |
… | …010010110001110001011011 |
3 | 112200121001122112120212021011 |
4 | 121131331202102301301123 |
5 | 104140133141401431021 |
6 | 1034120421412354351 |
7 | 32410314504026305 |
oct | 3135754222616133 |
9 | 480531575525234 |
10 | 112010101202011 |
11 | 32765243038611 |
12 | 106903843159b7 |
13 | 4a6667949792c |
14 | 1d93464178975 |
15 | ce398e3ddde1 |
hex | 65df624b1c5b |
112010101202011 has 8 divisors (see below), whose sum is σ = 114123657045600. Its totient is φ = 109896551199552.
The previous prime is 112010101201949. The next prime is 112010101202057. The reversal of 112010101202011 is 110202101010211.
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 112010101202011 - 211 = 112010101199963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112010101201982 and 112010101202000.
It is not an unprimeable number, because it can be changed into a prime (112010101202071) 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, 69298791 + ... + 70896703.
It is an arithmetic number, because the mean of its divisors is an integer number (14265457130700).
Almost surely, 2112010101202011 is an apocalyptic number.
112010101202011 is a deficient number, since it is larger than the sum of its proper divisors (2113555843589).
112010101202011 is a wasteful number, since it uses less digits than its factorization.
112010101202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2920565.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112010101202011 its reverse (110202101010211), we get a palindrome (222212202212222).
The spelling of 112010101202011 in words is "one hundred twelve trillion, ten billion, one hundred one million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •