Base | Representation |
---|---|
bin | 1010000110111011011001… |
… | …1011101101011111110111 |
3 | 1110100111112121021221211112 |
4 | 2201232312123231133313 |
5 | 2424043230111043221 |
6 | 35345433235425235 |
7 | 2224653530502446 |
oct | 241566633553767 |
9 | 43314477257745 |
10 | 11114141112311 |
11 | 35a5531a04a96 |
12 | 12b5bb345521b |
13 | 62809c84c073 |
14 | 2a5cda722d5d |
15 | 1441870ed15b |
hex | a1bb66ed7f7 |
11114141112311 has 2 divisors, whose sum is σ = 11114141112312. Its totient is φ = 11114141112310.
The previous prime is 11114141112287. The next prime is 11114141112407. The reversal of 11114141112311 is 11321114141111.
It is a m-pointer prime, because the next prime (11114141112407) can be obtained adding 11114141112311 to its product of digits (96).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11114141112311 - 210 = 11114141111287 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11114141172311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5557070556155 + 5557070556156.
It is an arithmetic number, because the mean of its divisors is an integer number (5557070556156).
Almost surely, 211114141112311 is an apocalyptic number.
11114141112311 is a deficient number, since it is larger than the sum of its proper divisors (1).
11114141112311 is an equidigital number, since it uses as much as digits as its factorization.
11114141112311 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 96, while the sum is 23.
Adding to 11114141112311 its reverse (11321114141111), we get a palindrome (22435255253422).
The spelling of 11114141112311 in words is "eleven trillion, one hundred fourteen billion, one hundred forty-one million, one hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •