Base | Representation |
---|---|
bin | 1010000110110011011110… |
… | …0010100011110010100001 |
3 | 1110100022001020101001200221 |
4 | 2201230313202203302201 |
5 | 2424024400110413441 |
6 | 35344442105443041 |
7 | 2224550010163336 |
oct | 241546742436241 |
9 | 43308036331627 |
10 | 11112012201121 |
11 | 35a463a21a557 |
12 | 12b56ba4a0481 |
13 | 627b2077a9c0 |
14 | 2a5b77aac98d |
15 | 1440b02748d1 |
hex | a1b378a3ca1 |
11112012201121 has 8 divisors (see below), whose sum is σ = 11998027238400. Its totient is φ = 10230460716432.
The previous prime is 11112012201077. The next prime is 11112012201161. The reversal of 11112012201121 is 12110221021111.
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 11112012201121 - 213 = 11112012192929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11112012201095 and 11112012201104.
It is not an unprimeable number, because it can be changed into a prime (11112012201161) 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, 1115882971 + ... + 1115892928.
It is an arithmetic number, because the mean of its divisors is an integer number (1499753404800).
Almost surely, 211112012201121 is an apocalyptic number.
It is an amenable number.
11112012201121 is a deficient number, since it is larger than the sum of its proper divisors (886015037279).
11112012201121 is a wasteful number, since it uses less digits than its factorization.
11112012201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2231776295.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11112012201121 its reverse (12110221021111), we get a palindrome (23222233222232).
The spelling of 11112012201121 in words is "eleven trillion, one hundred twelve billion, twelve million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •