Base | Representation |
---|---|
bin | 1100000010101111110101… |
… | …1111111111111011101101 |
3 | 1201212212012220111010000222 |
4 | 3000223331133333323231 |
5 | 3213421232102332003 |
6 | 44054553314101125 |
7 | 2534440542614054 |
oct | 300537537777355 |
9 | 51785186433028 |
10 | 13241342230253 |
11 | 4245692540435 |
12 | 159a31687a7a5 |
13 | 75086515c817 |
14 | 33ac54a6939b |
15 | 17e687375c38 |
hex | c0afd7ffeed |
13241342230253 has 2 divisors, whose sum is σ = 13241342230254. Its totient is φ = 13241342230252.
The previous prime is 13241342230213. The next prime is 13241342230271. The reversal of 13241342230253 is 35203224314231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9713924858089 + 3527417372164 = 3116717^2 + 1878142^2 .
It is a cyclic number.
It is not a de Polignac number, because 13241342230253 - 210 = 13241342229229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13241342230213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6620671115126 + 6620671115127.
It is an arithmetic number, because the mean of its divisors is an integer number (6620671115127).
Almost surely, 213241342230253 is an apocalyptic number.
It is an amenable number.
13241342230253 is a deficient number, since it is larger than the sum of its proper divisors (1).
13241342230253 is an equidigital number, since it uses as much as digits as its factorization.
13241342230253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 35.
Adding to 13241342230253 its reverse (35203224314231), we get a palindrome (48444566544484).
The spelling of 13241342230253 in words is "thirteen trillion, two hundred forty-one billion, three hundred forty-two million, two hundred thirty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •