Base | Representation |
---|---|
bin | 1011111011000111110010… |
… | …0100110011111100111111 |
3 | 1201102100001110021000120112 |
4 | 2332301330210303330333 |
5 | 3204244424013242114 |
6 | 43514445203540235 |
7 | 2522122130052455 |
oct | 276617444637477 |
9 | 51370043230515 |
10 | 13110330212159 |
11 | 41a507268a114 |
12 | 1578a5308a67b |
13 | 7413b670081b |
14 | 3347870049d5 |
15 | 17b06a75a13e |
hex | bec7c933f3f |
13110330212159 has 2 divisors, whose sum is σ = 13110330212160. Its totient is φ = 13110330212158.
The previous prime is 13110330212107. The next prime is 13110330212207. The reversal of 13110330212159 is 95121203301131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13110330212159 - 228 = 13110061776703 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13110330212359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555165106079 + 6555165106080.
It is an arithmetic number, because the mean of its divisors is an integer number (6555165106080).
Almost surely, 213110330212159 is an apocalyptic number.
13110330212159 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110330212159 is an equidigital number, since it uses as much as digits as its factorization.
13110330212159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 32.
The spelling of 13110330212159 in words is "thirteen trillion, one hundred ten billion, three hundred thirty million, two hundred twelve thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •