Base | Representation |
---|---|
bin | 1010000111010101010111… |
… | …1000001001100110110001 |
3 | 1110101011112100120122002100 |
4 | 2201311111320021212301 |
5 | 2424202013421041423 |
6 | 35352545023011013 |
7 | 2225321333512542 |
oct | 241652570114661 |
9 | 43334470518070 |
10 | 11121111112113 |
11 | 35a8489329002 |
12 | 12b7419739a69 |
13 | 62894087cbc2 |
14 | 2a639c2b04c9 |
15 | 144443e8d343 |
hex | a1d55e099b1 |
11121111112113 has 12 divisors (see below), whose sum is σ = 16064095614580. Its totient is φ = 7413950173536.
The previous prime is 11121111112087. The next prime is 11121111112123. The reversal of 11121111112113 is 31121111112111.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 4415999639184 + 6705111472929 = 2101428^2 + 2589423^2 .
It is a de Polignac number, because none of the positive numbers 2k-11121111112113 is a prime.
It is a super-2 number, since 2×111211111121132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121111112123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9754978 + ... + 10835211.
Almost surely, 211121111112113 is an apocalyptic number.
It is an amenable number.
11121111112113 is a deficient number, since it is larger than the sum of its proper divisors (4942984502467).
11121111112113 is a wasteful number, since it uses less digits than its factorization.
11121111112113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20650208 (or 20650205 counting only the distinct ones).
The product of its digits is 12, while the sum is 18.
Adding to 11121111112113 its reverse (31121111112111), we get a palindrome (42242222224224).
The spelling of 11121111112113 in words is "eleven trillion, one hundred twenty-one billion, one hundred eleven million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •