Base | Representation |
---|---|
bin | 1100000000011010110101… |
… | …0111000101101011010101 |
3 | 1201202000222021220021021002 |
4 | 3000012231113011223111 |
5 | 3212242322302332131 |
6 | 44024340244033045 |
7 | 2531523405066056 |
oct | 300065527055325 |
9 | 51660867807232 |
10 | 13201343011541 |
11 | 422a726a76393 |
12 | 1592613092785 |
13 | 749b5c2c1a79 |
14 | 338d3c62272d |
15 | 17d5e59956cb |
hex | c01ad5c5ad5 |
13201343011541 has 2 divisors, whose sum is σ = 13201343011542. Its totient is φ = 13201343011540.
The previous prime is 13201343011501. The next prime is 13201343011543. The reversal of 13201343011541 is 14511034310231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7271489764900 + 5929853246641 = 2696570^2 + 2435129^2 .
It is a cyclic number.
It is not a de Polignac number, because 13201343011541 - 210 = 13201343010517 is a prime.
Together with 13201343011543, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13201343011543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6600671505770 + 6600671505771.
It is an arithmetic number, because the mean of its divisors is an integer number (6600671505771).
Almost surely, 213201343011541 is an apocalyptic number.
It is an amenable number.
13201343011541 is a deficient number, since it is larger than the sum of its proper divisors (1).
13201343011541 is an equidigital number, since it uses as much as digits as its factorization.
13201343011541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 13201343011541 its reverse (14511034310231), we get a palindrome (27712377321772).
The spelling of 13201343011541 in words is "thirteen trillion, two hundred one billion, three hundred forty-three million, eleven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •