Base | Representation |
---|---|
bin | 1100001001010001011110… |
… | …1110111110110010000011 |
3 | 1202021120120222212212010202 |
4 | 3002110113232332302003 |
5 | 3222240332041440021 |
6 | 44222254013115415 |
7 | 2545516656041546 |
oct | 302242756766203 |
9 | 52246528785122 |
10 | 13353451515011 |
11 | 4289192290393 |
12 | 15b7ba3a88b6b |
13 | 75b2c06486ca |
14 | 34244c03485d |
15 | 18254971ba0b |
hex | c2517bbec83 |
13353451515011 has 2 divisors, whose sum is σ = 13353451515012. Its totient is φ = 13353451515010.
The previous prime is 13353451514999. The next prime is 13353451515049. The reversal of 13353451515011 is 11051515435331.
It is an a-pointer prime, because the next prime (13353451515049) can be obtained adding 13353451515011 to its sum of digits (38).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13353451515011 is a prime.
It is not a weakly prime, because it can be changed into another prime (13353451515211) 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, 6676725757505 + 6676725757506.
It is an arithmetic number, because the mean of its divisors is an integer number (6676725757506).
Almost surely, 213353451515011 is an apocalyptic number.
13353451515011 is a deficient number, since it is larger than the sum of its proper divisors (1).
13353451515011 is an equidigital number, since it uses as much as digits as its factorization.
13353451515011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 67500, while the sum is 38.
The spelling of 13353451515011 in words is "thirteen trillion, three hundred fifty-three billion, four hundred fifty-one million, five hundred fifteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •