Base | Representation |
---|---|
bin | 1100001101011101111001… |
… | …0111000111110101011001 |
3 | 1202112110120102020000122212 |
4 | 3003113132113013311121 |
5 | 3224430412332401403 |
6 | 44315331403124505 |
7 | 2553650330014136 |
oct | 303273627076531 |
9 | 52473512200585 |
10 | 13425503403353 |
11 | 43067a673a548 |
12 | 1609b51b13735 |
13 | 765033c07172 |
14 | 345b2537158d |
15 | 18436503e4d8 |
hex | c35de5c7d59 |
13425503403353 has 2 divisors, whose sum is σ = 13425503403354. Its totient is φ = 13425503403352.
The previous prime is 13425503403341. The next prime is 13425503403391. The reversal of 13425503403353 is 35330430552431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10599113674384 + 2826389728969 = 3255628^2 + 1681187^2 .
It is a cyclic number.
It is not a de Polignac number, because 13425503403353 - 222 = 13425499209049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13425503403353.
It is not a weakly prime, because it can be changed into another prime (13425503903353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6712751701676 + 6712751701677.
It is an arithmetic number, because the mean of its divisors is an integer number (6712751701677).
Almost surely, 213425503403353 is an apocalyptic number.
It is an amenable number.
13425503403353 is a deficient number, since it is larger than the sum of its proper divisors (1).
13425503403353 is an equidigital number, since it uses as much as digits as its factorization.
13425503403353 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972000, while the sum is 41.
Adding to 13425503403353 its reverse (35330430552431), we get a palindrome (48755933955784).
The spelling of 13425503403353 in words is "thirteen trillion, four hundred twenty-five billion, five hundred three million, four hundred three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •