Base | Representation |
---|---|
bin | 11001001010110100… |
… | …01011101100001101 |
3 | 1021212201012021011122 |
4 | 30211122023230031 |
5 | 210133201210014 |
6 | 10112500130325 |
7 | 655565355233 |
oct | 144532135415 |
9 | 37781167148 |
10 | 13512522509 |
11 | 5804515182 |
12 | 27513969a5 |
13 | 137461c865 |
14 | 922860953 |
15 | 54144058e |
hex | 32568bb0d |
13512522509 has 2 divisors, whose sum is σ = 13512522510. Its totient is φ = 13512522508.
The previous prime is 13512522503. The next prime is 13512522511. The reversal of 13512522509 is 90522521531.
13512522509 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13279105225 + 233417284 = 115235^2 + 15278^2 .
It is a cyclic number.
It is not a de Polignac number, because 13512522509 - 212 = 13512518413 is a prime.
Together with 13512522511, 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 (13512522503) 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, 6756261254 + 6756261255.
It is an arithmetic number, because the mean of its divisors is an integer number (6756261255).
Almost surely, 213512522509 is an apocalyptic number.
It is an amenable number.
13512522509 is a deficient number, since it is larger than the sum of its proper divisors (1).
13512522509 is an equidigital number, since it uses as much as digits as its factorization.
13512522509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 13512522509 in words is "thirteen billion, five hundred twelve million, five hundred twenty-two thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •