Base | Representation |
---|---|
bin | 1100101001100… |
… | …0000010101101 |
3 | 10200211022001210 |
4 | 3022120002231 |
5 | 102040122230 |
6 | 5133025033 |
7 | 1212634200 |
oct | 312300255 |
9 | 120738053 |
10 | 53051565 |
11 | 27a45476 |
12 | 15925179 |
13 | acb6378 |
14 | 708d937 |
15 | 49cdeb0 |
hex | 32980ad |
53051565 has 48 divisors (see below), whose sum is σ = 99973440. Its totient is φ = 23950080.
The previous prime is 53051549. The next prime is 53051567. The reversal of 53051565 is 56515035.
It is not a de Polignac number, because 53051565 - 24 = 53051549 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53051567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 65010 + ... + 65820.
It is an arithmetic number, because the mean of its divisors is an integer number (2082780).
Almost surely, 253051565 is an apocalyptic number.
It is an amenable number.
53051565 is a deficient number, since it is larger than the sum of its proper divisors (46921875).
53051565 is a wasteful number, since it uses less digits than its factorization.
53051565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 922 (or 915 counting only the distinct ones).
The product of its (nonzero) digits is 11250, while the sum is 30.
The square root of 53051565 is about 7283.6505270366. The cubic root of 53051565 is about 375.7503553546.
The spelling of 53051565 in words is "fifty-three million, fifty-one thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •