Base | Representation |
---|---|
bin | 1010000110111011010010… |
… | …1010110011001000010111 |
3 | 1110100111110112121011100212 |
4 | 2201232310222303020113 |
5 | 2424043200021404421 |
6 | 35345430301200035 |
7 | 2224653021063425 |
oct | 241566452631027 |
9 | 43314415534325 |
10 | 11114111513111 |
11 | 35a5517228742 |
12 | 12b5ba556001b |
13 | 628096687649 |
14 | 2a5cd681a115 |
15 | 144184702e5b |
hex | a1bb4ab3217 |
11114111513111 has 2 divisors, whose sum is σ = 11114111513112. Its totient is φ = 11114111513110.
The previous prime is 11114111513093. The next prime is 11114111513171. The reversal of 11114111513111 is 11131511141111.
11114111513111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a m-pointer prime, because the next prime (11114111513171) can be obtained adding 11114111513111 to its product of digits (60).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11114111513111 - 26 = 11114111513047 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11114111513171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5557055756555 + 5557055756556.
It is an arithmetic number, because the mean of its divisors is an integer number (5557055756556).
Almost surely, 211114111513111 is an apocalyptic number.
11114111513111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11114111513111 is an equidigital number, since it uses as much as digits as its factorization.
11114111513111 is an evil number, because the sum of its binary digits is even.
The product of its digits is 60, while the sum is 23.
Adding to 11114111513111 its reverse (11131511141111), we get a palindrome (22245622654222).
The spelling of 11114111513111 in words is "eleven trillion, one hundred fourteen billion, one hundred eleven million, five hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •