Base | Representation |
---|---|
bin | 1100001100110001000000… |
… | …1111000000000111101001 |
3 | 1202111022110202110120201021 |
4 | 3003030100033000013221 |
5 | 3224231224014433023 |
6 | 44310020053052441 |
7 | 2553042632164426 |
oct | 303142017000751 |
9 | 52438422416637 |
10 | 13413455233513 |
11 | 4301683878195 |
12 | 160774b027121 |
13 | 763b63aa829a |
14 | 3453011b4d4d |
15 | 183dac45635d |
hex | c33103c01e9 |
13413455233513 has 2 divisors, whose sum is σ = 13413455233514. Its totient is φ = 13413455233512.
The previous prime is 13413455233447. The next prime is 13413455233559. The reversal of 13413455233513 is 31533255431431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7128942720064 + 6284512513449 = 2670008^2 + 2506893^2 .
It is a cyclic number.
It is not a de Polignac number, because 13413455233513 - 213 = 13413455225321 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13413455233513.
It is not a weakly prime, because it can be changed into another prime (13413405233513) 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, 6706727616756 + 6706727616757.
It is an arithmetic number, because the mean of its divisors is an integer number (6706727616757).
Almost surely, 213413455233513 is an apocalyptic number.
It is an amenable number.
13413455233513 is a deficient number, since it is larger than the sum of its proper divisors (1).
13413455233513 is an equidigital number, since it uses as much as digits as its factorization.
13413455233513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 972000, while the sum is 43.
The spelling of 13413455233513 in words is "thirteen trillion, four hundred thirteen billion, four hundred fifty-five million, two hundred thirty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •