Base | Representation |
---|---|
bin | 11000100101101000… |
… | …00101110100110111 |
3 | 1021001222011021101212 |
4 | 30102310011310313 |
5 | 204013320002002 |
6 | 10021513312035 |
7 | 645056541065 |
oct | 142264056467 |
9 | 37058137355 |
10 | 13200547127 |
11 | 5664401489 |
12 | 2684a0561b |
13 | 1324abb041 |
14 | 8d3251035 |
15 | 523d68352 |
hex | 312d05d37 |
13200547127 has 2 divisors, whose sum is σ = 13200547128. Its totient is φ = 13200547126.
The previous prime is 13200547099. The next prime is 13200547153. The reversal of 13200547127 is 72174500231.
13200547127 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 is a cyclic number.
It is not a de Polignac number, because 13200547127 - 232 = 8905579831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13200547093 and 13200547102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13200547177) 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, 6600273563 + 6600273564.
It is an arithmetic number, because the mean of its divisors is an integer number (6600273564).
Almost surely, 213200547127 is an apocalyptic number.
13200547127 is a deficient number, since it is larger than the sum of its proper divisors (1).
13200547127 is an equidigital number, since it uses as much as digits as its factorization.
13200547127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11760, while the sum is 32.
The spelling of 13200547127 in words is "thirteen billion, two hundred million, five hundred forty-seven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •