Base | Representation |
---|---|
bin | 11000011010110110… |
… | …01011001101100111 |
3 | 1020211200000120202021 |
4 | 30031123023031213 |
5 | 203322143121021 |
6 | 10004523324011 |
7 | 642611155633 |
oct | 141533131547 |
9 | 36750016667 |
10 | 13110129511 |
11 | 5618365386 |
12 | 265a680607 |
13 | 130c150cab |
14 | 8c5235dc3 |
15 | 51ae57c41 |
hex | 30d6cb367 |
13110129511 has 2 divisors, whose sum is σ = 13110129512. Its totient is φ = 13110129510.
The previous prime is 13110129503. The next prime is 13110129517. The reversal of 13110129511 is 11592101131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13110129511 - 23 = 13110129503 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13110129517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555064755 + 6555064756.
It is an arithmetic number, because the mean of its divisors is an integer number (6555064756).
Almost surely, 213110129511 is an apocalyptic number.
13110129511 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110129511 is an equidigital number, since it uses as much as digits as its factorization.
13110129511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 25.
The spelling of 13110129511 in words is "thirteen billion, one hundred ten million, one hundred twenty-nine thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •