Base | Representation |
---|---|
bin | 1100000011011000101011… |
… | …1100001001011101001101 |
3 | 1201220220111221010012010121 |
4 | 3000312022330021131031 |
5 | 3214111210103200331 |
6 | 44104005215104541 |
7 | 2535306322003603 |
oct | 300661274113515 |
9 | 51826457105117 |
10 | 13252305131341 |
11 | 424a2a883a271 |
12 | 15a0476212151 |
13 | 7518c1497c43 |
14 | 33b5b4a3d873 |
15 | 17eac9a37c11 |
hex | c0d8af0974d |
13252305131341 has 2 divisors, whose sum is σ = 13252305131342. Its totient is φ = 13252305131340.
The previous prime is 13252305131333. The next prime is 13252305131347. The reversal of 13252305131341 is 14313150325231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6654573485316 + 6597731646025 = 2579646^2 + 2568605^2 .
It is a cyclic number.
It is not a de Polignac number, because 13252305131341 - 23 = 13252305131333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13252305131297 and 13252305131306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13252305131347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6626152565670 + 6626152565671.
It is an arithmetic number, because the mean of its divisors is an integer number (6626152565671).
Almost surely, 213252305131341 is an apocalyptic number.
It is an amenable number.
13252305131341 is a deficient number, since it is larger than the sum of its proper divisors (1).
13252305131341 is an equidigital number, since it uses as much as digits as its factorization.
13252305131341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 13252305131341 its reverse (14313150325231), we get a palindrome (27565455456572).
The spelling of 13252305131341 in words is "thirteen trillion, two hundred fifty-two billion, three hundred five million, one hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •