Base | Representation |
---|---|
bin | 11001001110000010… |
… | …00101011111100101 |
3 | 1021221120221202112022 |
4 | 30213001011133211 |
5 | 210212102413312 |
6 | 10115302232525 |
7 | 656343555656 |
oct | 144701053745 |
9 | 37846852468 |
10 | 13539497957 |
11 | 581876a237 |
12 | 275a425745 |
13 | 137a0a5c6b |
14 | 92628352d |
15 | 5439bd172 |
hex | 3270457e5 |
13539497957 has 2 divisors, whose sum is σ = 13539497958. Its totient is φ = 13539497956.
The previous prime is 13539497947. The next prime is 13539497971. The reversal of 13539497957 is 75979493531.
13539497957 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., 13326162721 + 213335236 = 115439^2 + 14606^2 .
It is a cyclic number.
It is not a de Polignac number, because 13539497957 - 210 = 13539496933 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13539497957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13539497947) 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, 6769748978 + 6769748979.
It is an arithmetic number, because the mean of its divisors is an integer number (6769748979).
Almost surely, 213539497957 is an apocalyptic number.
It is an amenable number.
13539497957 is a deficient number, since it is larger than the sum of its proper divisors (1).
13539497957 is an equidigital number, since it uses as much as digits as its factorization.
13539497957 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32148900, while the sum is 62.
The spelling of 13539497957 in words is "thirteen billion, five hundred thirty-nine million, four hundred ninety-seven thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •