Base | Representation |
---|---|
bin | 110011111011010110… |
… | …0100001111111101001 |
3 | 101122211112110221022012 |
4 | 1213312230201333221 |
5 | 3311334320113423 |
6 | 123121155405305 |
7 | 11025253203122 |
oct | 1476654417751 |
9 | 348745427265 |
10 | 111513051113 |
11 | 43324234882 |
12 | 197415b3835 |
13 | a691b0b719 |
14 | 557c123049 |
15 | 2d79d6e078 |
hex | 19f6b21fe9 |
111513051113 has 2 divisors, whose sum is σ = 111513051114. Its totient is φ = 111513051112.
The previous prime is 111513051103. The next prime is 111513051119. The reversal of 111513051113 is 311150315111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75387586624 + 36125464489 = 274568^2 + 190067^2 .
It is an emirp because it is prime and its reverse (311150315111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111513051113 - 218 = 111512788969 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (111513051119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55756525556 + 55756525557.
It is an arithmetic number, because the mean of its divisors is an integer number (55756525557).
Almost surely, 2111513051113 is an apocalyptic number.
It is an amenable number.
111513051113 is a deficient number, since it is larger than the sum of its proper divisors (1).
111513051113 is an equidigital number, since it uses as much as digits as its factorization.
111513051113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 225, while the sum is 23.
Adding to 111513051113 its reverse (311150315111), we get a palindrome (422663366224).
The spelling of 111513051113 in words is "one hundred eleven billion, five hundred thirteen million, fifty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •