Base | Representation |
---|---|
bin | 1010000110101100010110… |
… | …1011110000110011110001 |
3 | 1110100010010010000100122011 |
4 | 2201223011223300303301 |
5 | 2424011442103323441 |
6 | 35343524351442521 |
7 | 2224451453633311 |
oct | 241530553606361 |
9 | 43303103010564 |
10 | 11110102011121 |
11 | 35a3849a44533 |
12 | 12b5266826441 |
13 | 6278a7ab9c69 |
14 | 2a5a36111441 |
15 | 143eec702581 |
hex | a1ac5af0cf1 |
11110102011121 has 8 divisors (see below), whose sum is σ = 11593187573760. Its totient is φ = 10627019585952.
The previous prime is 11110102011079. The next prime is 11110102011139. The reversal of 11110102011121 is 12111020101111.
11110102011121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11110102011121 - 27 = 11110102010993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11110102015121) 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, 9104656 + ... + 10252558.
It is an arithmetic number, because the mean of its divisors is an integer number (1449148446720).
Almost surely, 211110102011121 is an apocalyptic number.
It is an amenable number.
11110102011121 is a deficient number, since it is larger than the sum of its proper divisors (483085562639).
11110102011121 is a wasteful number, since it uses less digits than its factorization.
11110102011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1568735.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11110102011121 its reverse (12111020101111), we get a palindrome (23221122112232).
The spelling of 11110102011121 in words is "eleven trillion, one hundred ten billion, one hundred two million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •