Base | Representation |
---|---|
bin | 1100001101011010001101… |
… | …0101111010100110011001 |
3 | 1202112101000102001001220021 |
4 | 3003112203111322212121 |
5 | 3224421400341400012 |
6 | 44315045232230441 |
7 | 2553613644465052 |
oct | 303264325724631 |
9 | 52471012031807 |
10 | 13424513231257 |
11 | 43063388195a7 |
12 | 160991639b421 |
13 | 764c06a2b40b |
14 | 345a6da61729 |
15 | 184308150007 |
hex | c35a357a999 |
13424513231257 has 2 divisors, whose sum is σ = 13424513231258. Its totient is φ = 13424513231256.
The previous prime is 13424513231149. The next prime is 13424513231273. The reversal of 13424513231257 is 75213231542431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10420603785216 + 3003909446041 = 3228096^2 + 1733179^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13424513231257 is a prime.
It is not a weakly prime, because it can be changed into another prime (13424513231557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6712256615628 + 6712256615629.
It is an arithmetic number, because the mean of its divisors is an integer number (6712256615629).
Almost surely, 213424513231257 is an apocalyptic number.
It is an amenable number.
13424513231257 is a deficient number, since it is larger than the sum of its proper divisors (1).
13424513231257 is an equidigital number, since it uses as much as digits as its factorization.
13424513231257 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 604800, while the sum is 43.
Adding to 13424513231257 its reverse (75213231542431), we get a palindrome (88637744773688).
The spelling of 13424513231257 in words is "thirteen trillion, four hundred twenty-four billion, five hundred thirteen million, two hundred thirty-one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •