Base | Representation |
---|---|
bin | 1011111011000111010110… |
… | …1011000010000010111101 |
3 | 1201102022202101100021020011 |
4 | 2332301311223002002331 |
5 | 3204244204341332422 |
6 | 43514425505423221 |
7 | 2522116222512301 |
oct | 276616553020275 |
9 | 51368671307204 |
10 | 13110214402237 |
11 | 41a501327a437 |
12 | 1578a2033ab11 |
13 | 741398712b44 |
14 | 334775899d01 |
15 | 17b0604d1077 |
hex | bec75ac20bd |
13110214402237 has 2 divisors, whose sum is σ = 13110214402238. Its totient is φ = 13110214402236.
The previous prime is 13110214402163. The next prime is 13110214402277. The reversal of 13110214402237 is 73220441201131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11768645858116 + 1341568544121 = 3430546^2 + 1158261^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13110214402237 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13110214402199 and 13110214402208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13110214402277) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555107201118 + 6555107201119.
It is an arithmetic number, because the mean of its divisors is an integer number (6555107201119).
Almost surely, 213110214402237 is an apocalyptic number.
It is an amenable number.
13110214402237 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110214402237 is an equidigital number, since it uses as much as digits as its factorization.
13110214402237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8064, while the sum is 31.
Adding to 13110214402237 its reverse (73220441201131), we get a palindrome (86330655603368).
The spelling of 13110214402237 in words is "thirteen trillion, one hundred ten billion, two hundred fourteen million, four hundred two thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •