Base | Representation |
---|---|
bin | 100110011001100001110… |
… | …1010011000001000010001 |
3 | 200200112011020001000111212 |
4 | 1030303003222120020101 |
5 | 1142431311120133424 |
6 | 15120241242145505 |
7 | 1053200301065504 |
oct | 114630352301021 |
9 | 20615136030455 |
10 | 5277502505489 |
11 | 17551a3642195 |
12 | 712994ab2295 |
13 | 2c3887c85336 |
14 | 14360aa4513b |
15 | 9242ec8110e |
hex | 4ccc3a98211 |
5277502505489 has 2 divisors, whose sum is σ = 5277502505490. Its totient is φ = 5277502505488.
The previous prime is 5277502505441. The next prime is 5277502505491. The reversal of 5277502505489 is 9845052057725.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4228813862464 + 1048688643025 = 2056408^2 + 1024055^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5277502505489 is a prime.
Together with 5277502505491, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (5277502505419) 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, 2638751252744 + 2638751252745.
It is an arithmetic number, because the mean of its divisors is an integer number (2638751252745).
Almost surely, 25277502505489 is an apocalyptic number.
It is an amenable number.
5277502505489 is a deficient number, since it is larger than the sum of its proper divisors (1).
5277502505489 is an equidigital number, since it uses as much as digits as its factorization.
5277502505489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35280000, while the sum is 59.
The spelling of 5277502505489 in words is "five trillion, two hundred seventy-seven billion, five hundred two million, five hundred five thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •