Base | Representation |
---|---|
bin | 1010000110110000001001… |
… | …1110110000001111101001 |
3 | 1110100012202012022201120122 |
4 | 2201230002132300033221 |
5 | 2424021034213323423 |
6 | 35344213505533025 |
7 | 2224515650533235 |
oct | 241540236601751 |
9 | 43305665281518 |
10 | 11111122011113 |
11 | 35a4222788633 |
12 | 12b54b0344175 |
13 | 627a0b20a557 |
14 | 2a5ad17875c5 |
15 | 14405c0348c8 |
hex | a1b027b03e9 |
11111122011113 has 8 divisors (see below), whose sum is σ = 11118523104000. Its totient is φ = 11103722232768.
The previous prime is 11111122011091. The next prime is 11111122011139. The reversal of 11111122011113 is 31111022111111.
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 11111122011113 - 214 = 11111121994729 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11111122011091 and 11111122011100.
It is not an unprimeable number, because it can be changed into a prime (11111122011013) 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, 16881248 + ... + 17527086.
It is an arithmetic number, because the mean of its divisors is an integer number (1389815388000).
Almost surely, 211111122011113 is an apocalyptic number.
It is an amenable number.
11111122011113 is a deficient number, since it is larger than the sum of its proper divisors (7401092887).
11111122011113 is an equidigital number, since it uses as much as digits as its factorization.
11111122011113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 657271.
The product of its (nonzero) digits is 12, while the sum is 17.
Adding to 11111122011113 its reverse (31111022111111), we get a palindrome (42222144122224).
The spelling of 11111122011113 in words is "eleven trillion, one hundred eleven billion, one hundred twenty-two million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •