Base | Representation |
---|---|
bin | 1011111011000111000101… |
… | …0011001011011100101011 |
3 | 1201102022120021022002202002 |
4 | 2332301301103023130223 |
5 | 3204244032101243202 |
6 | 43514414325201215 |
7 | 2522114342114414 |
oct | 276616123133453 |
9 | 51368507262662 |
10 | 13110141040427 |
11 | 41a4a85922642 |
12 | 15789bb86020b |
13 | 7413864680a2 |
14 | 334769c4080b |
15 | 17b058d3e302 |
hex | bec714cb72b |
13110141040427 has 2 divisors, whose sum is σ = 13110141040428. Its totient is φ = 13110141040426.
The previous prime is 13110141040387. The next prime is 13110141040457. The reversal of 13110141040427 is 72404014101131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13110141040427 - 222 = 13110136846123 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13110141040427.
It is not a weakly prime, because it can be changed into another prime (13110141040457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555070520213 + 6555070520214.
It is an arithmetic number, because the mean of its divisors is an integer number (6555070520214).
Almost surely, 213110141040427 is an apocalyptic number.
13110141040427 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110141040427 is an equidigital number, since it uses as much as digits as its factorization.
13110141040427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 29.
Adding to 13110141040427 its reverse (72404014101131), we get a palindrome (85514155141558).
The spelling of 13110141040427 in words is "thirteen trillion, one hundred ten billion, one hundred forty-one million, forty thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •