Base | Representation |
---|---|
bin | 1100000010110000110101… |
… | …1110011000110010101001 |
3 | 1201212212220120210120201221 |
4 | 3000230031132120302221 |
5 | 3213422304210240431 |
6 | 44055040050342041 |
7 | 2534450305651042 |
oct | 300541536306251 |
9 | 51785816716657 |
10 | 13241610243241 |
11 | 424580a857576 |
12 | 159a39058a921 |
13 | 7508a883b0a3 |
14 | 33ac7c4b38c9 |
15 | 17e6a0b67111 |
hex | c0b0d798ca9 |
13241610243241 has 2 divisors, whose sum is σ = 13241610243242. Its totient is φ = 13241610243240.
The previous prime is 13241610243187. The next prime is 13241610243283. The reversal of 13241610243241 is 14234201614231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12592987795600 + 648622447641 = 3548660^2 + 805371^2 .
It is a cyclic number.
It is not a de Polignac number, because 13241610243241 - 227 = 13241476025513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13241610243197 and 13241610243206.
It is not a weakly prime, because it can be changed into another prime (13241610243341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6620805121620 + 6620805121621.
It is an arithmetic number, because the mean of its divisors is an integer number (6620805121621).
Almost surely, 213241610243241 is an apocalyptic number.
It is an amenable number.
13241610243241 is a deficient number, since it is larger than the sum of its proper divisors (1).
13241610243241 is an equidigital number, since it uses as much as digits as its factorization.
13241610243241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27648, while the sum is 34.
Adding to 13241610243241 its reverse (14234201614231), we get a palindrome (27475811857472).
The spelling of 13241610243241 in words is "thirteen trillion, two hundred forty-one billion, six hundred ten million, two hundred forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •