Base | Representation |
---|---|
bin | 11001001010110111… |
… | …00000101010011101 |
3 | 1021212201211221121022 |
4 | 30211123200222131 |
5 | 210133243324212 |
6 | 10112511413525 |
7 | 655601335034 |
oct | 144533405235 |
9 | 37781757538 |
10 | 13512870557 |
11 | 580473271a |
12 | 27515242a5 |
13 | 13747120c4 |
14 | 92291171b |
15 | 5414ad772 |
hex | 3256e0a9d |
13512870557 has 2 divisors, whose sum is σ = 13512870558. Its totient is φ = 13512870556.
The previous prime is 13512870541. The next prime is 13512870583. The reversal of 13512870557 is 75507821531.
13512870557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10680395716 + 2832474841 = 103346^2 + 53221^2 .
It is an emirp because it is prime and its reverse (75507821531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13512870557 - 24 = 13512870541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13512870587) 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, 6756435278 + 6756435279.
It is an arithmetic number, because the mean of its divisors is an integer number (6756435279).
Almost surely, 213512870557 is an apocalyptic number.
It is an amenable number.
13512870557 is a deficient number, since it is larger than the sum of its proper divisors (1).
13512870557 is an equidigital number, since it uses as much as digits as its factorization.
13512870557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 294000, while the sum is 44.
The spelling of 13512870557 in words is "thirteen billion, five hundred twelve million, eight hundred seventy thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •