Base | Representation |
---|---|
bin | 1010000110111011110001… |
… | …1001001011010011001001 |
3 | 1110100111210120110102120121 |
4 | 2201232330121023103021 |
5 | 2424043431211024431 |
6 | 35345451211023241 |
7 | 2224656153461512 |
oct | 241567431132311 |
9 | 43314716412517 |
10 | 11114241111241 |
11 | 35a55833a5734 |
12 | 12b6020a3ab21 |
13 | 6280b7492228 |
14 | 2a5d09b13a09 |
15 | 144190ca2611 |
hex | a1bbc64b4c9 |
11114241111241 has 2 divisors, whose sum is σ = 11114241111242. Its totient is φ = 11114241111240.
The previous prime is 11114241111209. The next prime is 11114241111299. The reversal of 11114241111241 is 14211114241111.
11114241111241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8211783715641 + 2902457395600 = 2865621^2 + 1703660^2 .
It is a cyclic number.
It is not a de Polignac number, because 11114241111241 - 25 = 11114241111209 is a prime.
It is not a weakly prime, because it can be changed into another prime (11114241111341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5557120555620 + 5557120555621.
It is an arithmetic number, because the mean of its divisors is an integer number (5557120555621).
Almost surely, 211114241111241 is an apocalyptic number.
It is an amenable number.
11114241111241 is a deficient number, since it is larger than the sum of its proper divisors (1).
11114241111241 is an equidigital number, since it uses as much as digits as its factorization.
11114241111241 is an evil number, because the sum of its binary digits is even.
The product of its digits is 256, while the sum is 25.
Adding to 11114241111241 its reverse (14211114241111), we get a palindrome (25325355352352).
The spelling of 11114241111241 in words is "eleven trillion, one hundred fourteen billion, two hundred forty-one million, one hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •