Base | Representation |
---|---|
bin | 11001011111011011101100… |
… | …110110001110111101001001 |
3 | 112200221201121222121222200111 |
4 | 121133123230312032331021 |
5 | 104143312224230001301 |
6 | 1034235102345034321 |
7 | 32420524203443506 |
oct | 3137335466167511 |
9 | 480851558558614 |
10 | 112111210000201 |
11 | 327a4108348155 |
12 | 106a7aa14859a1 |
13 | 4a73070918879 |
14 | 1d982d65884ad |
15 | ce640ab4b551 |
hex | 65f6ecd8ef49 |
112111210000201 has 16 divisors (see below), whose sum is σ = 112357024047360. Its totient is φ = 111865655753280.
The previous prime is 112111210000091. The next prime is 112111210000249. The reversal of 112111210000201 is 102000012111211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 112111210000201 - 29 = 112111209999689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112111210000901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7096985835 + ... + 7097001631.
It is an arithmetic number, because the mean of its divisors is an integer number (7022314002960).
Almost surely, 2112111210000201 is an apocalyptic number.
It is an amenable number.
112111210000201 is a deficient number, since it is larger than the sum of its proper divisors (245814047159).
112111210000201 is a wasteful number, since it uses less digits than its factorization.
112111210000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23064.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112111210000201 its reverse (102000012111211), we get a palindrome (214111222111412).
The spelling of 112111210000201 in words is "one hundred twelve trillion, one hundred eleven billion, two hundred ten million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •