Base | Representation |
---|---|
bin | 1100000000011110001011… |
… | …1001001100100110000001 |
3 | 1201202010021212220012001022 |
4 | 3000013202321030212001 |
5 | 3212301142213121332 |
6 | 44025005330115225 |
7 | 2531554562102435 |
oct | 300074271144601 |
9 | 51663255805038 |
10 | 13202241145217 |
11 | 4230047a43523 |
12 | 1592823a1bb15 |
13 | 749c733b3b07 |
14 | 338dc5a149c5 |
15 | 17d649754212 |
hex | c01e2e4c981 |
13202241145217 has 2 divisors, whose sum is σ = 13202241145218. Its totient is φ = 13202241145216.
The previous prime is 13202241145099. The next prime is 13202241145277. The reversal of 13202241145217 is 71254114220231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12765585826816 + 436655318401 = 3572896^2 + 660799^2 .
It is a cyclic number.
It is not a de Polignac number, because 13202241145217 - 236 = 13133521668481 is a prime.
It is not a weakly prime, because it can be changed into another prime (13202241145277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6601120572608 + 6601120572609.
It is an arithmetic number, because the mean of its divisors is an integer number (6601120572609).
Almost surely, 213202241145217 is an apocalyptic number.
It is an amenable number.
13202241145217 is a deficient number, since it is larger than the sum of its proper divisors (1).
13202241145217 is an equidigital number, since it uses as much as digits as its factorization.
13202241145217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26880, while the sum is 35.
Adding to 13202241145217 its reverse (71254114220231), we get a palindrome (84456355365448).
The spelling of 13202241145217 in words is "thirteen trillion, two hundred two billion, two hundred forty-one million, one hundred forty-five thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •