Base | Representation |
---|---|
bin | 1010000110110100010000… |
… | …0000101000011100101001 |
3 | 1110100022120211001000212011 |
4 | 2201231010000220130221 |
5 | 2424030312140123423 |
6 | 35344514541515521 |
7 | 2224555130350114 |
oct | 241550400503451 |
9 | 43308524030764 |
10 | 11112221411113 |
11 | 35a4737323079 |
12 | 12b5758572ba1 |
13 | 627b54c0b0b4 |
14 | 2a5b977ab57b |
15 | 1440c37ecb0d |
hex | a1b44028729 |
11112221411113 has 2 divisors, whose sum is σ = 11112221411114. Its totient is φ = 11112221411112.
The previous prime is 11112221411089. The next prime is 11112221411209. The reversal of 11112221411113 is 31111412221111.
It is a m-pointer prime, because the next prime (11112221411209) can be obtained adding 11112221411113 to its product of digits (96).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8965551028009 + 2146670383104 = 2994253^2 + 1465152^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112221411113 - 221 = 11112219313961 is a prime.
It is not a weakly prime, because it can be changed into another prime (11112221451113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556110705556 + 5556110705557.
It is an arithmetic number, because the mean of its divisors is an integer number (5556110705557).
Almost surely, 211112221411113 is an apocalyptic number.
It is an amenable number.
11112221411113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112221411113 is an equidigital number, since it uses as much as digits as its factorization.
11112221411113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 96, while the sum is 22.
Adding to 11112221411113 its reverse (31111412221111), we get a palindrome (42223633632224).
The spelling of 11112221411113 in words is "eleven trillion, one hundred twelve billion, two hundred twenty-one million, four hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •