Base | Representation |
---|---|
bin | 1100101001101… |
… | …1011100010001 |
3 | 10200212000011111 |
4 | 3022123130101 |
5 | 102041043424 |
6 | 5133213321 |
7 | 1213022611 |
oct | 312333421 |
9 | 120760144 |
10 | 53065489 |
11 | 27a54984 |
12 | 15931241 |
13 | acbc7c9 |
14 | 7094a41 |
15 | 49d3194 |
hex | 329b711 |
53065489 has 2 divisors, whose sum is σ = 53065490. Its totient is φ = 53065488.
The previous prime is 53065487. The next prime is 53065513. The reversal of 53065489 is 98456035.
53065489 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., 31979025 + 21086464 = 5655^2 + 4592^2 .
It is a cyclic number.
It is not a de Polignac number, because 53065489 - 21 = 53065487 is a prime.
It is a super-2 number, since 2×530654892 = 5631892245618242, which contains 22 as substring.
Together with 53065487, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (53065487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26532744 + 26532745.
It is an arithmetic number, because the mean of its divisors is an integer number (26532745).
Almost surely, 253065489 is an apocalyptic number.
It is an amenable number.
53065489 is a deficient number, since it is larger than the sum of its proper divisors (1).
53065489 is an equidigital number, since it uses as much as digits as its factorization.
53065489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 40.
The square root of 53065489 is about 7284.6063037065. The cubic root of 53065489 is about 375.7832258287.
The spelling of 53065489 in words is "fifty-three million, sixty-five thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •