Base | Representation |
---|---|
bin | 1100001100101011100110… |
… | …1101001000110001111101 |
3 | 1202111011201120210200000002 |
4 | 3003022321231020301331 |
5 | 3224220240344444032 |
6 | 44305220033444045 |
7 | 2552661643610435 |
oct | 303127155106175 |
9 | 52434646720002 |
10 | 13412003515517 |
11 | 4300aa9374a52 |
12 | 1607404a10625 |
13 | 7639920bc459 |
14 | 34520447d2c5 |
15 | 183d24c97862 |
hex | c32b9b48c7d |
13412003515517 has 2 divisors, whose sum is σ = 13412003515518. Its totient is φ = 13412003515516.
The previous prime is 13412003515507. The next prime is 13412003515529. The reversal of 13412003515517 is 71551530021431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11946327671716 + 1465675843801 = 3456346^2 + 1210651^2 .
It is a cyclic number.
It is not a de Polignac number, because 13412003515517 - 230 = 13410929773693 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13412003515507) 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, 6706001757758 + 6706001757759.
It is an arithmetic number, because the mean of its divisors is an integer number (6706001757759).
Almost surely, 213412003515517 is an apocalyptic number.
It is an amenable number.
13412003515517 is a deficient number, since it is larger than the sum of its proper divisors (1).
13412003515517 is an equidigital number, since it uses as much as digits as its factorization.
13412003515517 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63000, while the sum is 38.
Adding to 13412003515517 its reverse (71551530021431), we get a palindrome (84963533536948).
The spelling of 13412003515517 in words is "thirteen trillion, four hundred twelve billion, three million, five hundred fifteen thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •