Base | Representation |
---|---|
bin | 1010000111010001111110… |
… | …1000110001001001101001 |
3 | 1110101002011221020202000212 |
4 | 2201310133220301021221 |
5 | 2424143132441010441 |
6 | 35352314434310505 |
7 | 2225256643565525 |
oct | 241643750611151 |
9 | 43332157222025 |
10 | 11120201110121 |
11 | 35a8061695044 |
12 | 12b7204a28435 |
13 | 628827193a9c |
14 | 2a63134acd85 |
15 | 1443de137eeb |
hex | a1d1fa31269 |
11120201110121 has 8 divisors (see below), whose sum is σ = 11245945592160. Its totient is φ = 10994474370528.
The previous prime is 11120201110049. The next prime is 11120201110169. The reversal of 11120201110121 is 12101110202111.
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 11120201110121 - 210 = 11120201109097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11120201110096 and 11120201110105.
It is not an unprimeable number, because it can be changed into a prime (11120201110171) 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, 3172991 + ... + 5684036.
It is an arithmetic number, because the mean of its divisors is an integer number (1405743199020).
Almost surely, 211120201110121 is an apocalyptic number.
It is an amenable number.
11120201110121 is a deficient number, since it is larger than the sum of its proper divisors (125744482039).
11120201110121 is an equidigital number, since it uses as much as digits as its factorization.
11120201110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8871223.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11120201110121 its reverse (12101110202111), we get a palindrome (23221311312232).
The spelling of 11120201110121 in words is "eleven trillion, one hundred twenty billion, two hundred one million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •