Search a number
-
+
53031515 = 579134257
BaseRepresentation
bin1100101001001…
…1001001011011
310200210021120012
43022103021123
5102034002030
65132352135
71212521555
oct312231133
9120707505
1053031515
1127a313a9
121591564b
13acaa1c4
1470864d5
1549c8095
hex329325b

53031515 has 8 divisors (see below), whose sum is σ = 64443840. Its totient is φ = 41887872.

The previous prime is 53031481. The next prime is 53031521. The reversal of 53031515 is 51513035.

53031515 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 53031515 - 28 = 53031259 is a prime.

It is an unprimeable number.

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 in 7 ways as a sum of consecutive naturals, for example, 66734 + ... + 67523.

It is an arithmetic number, because the mean of its divisors is an integer number (8055480).

Almost surely, 253031515 is an apocalyptic number.

53031515 is a deficient number, since it is larger than the sum of its proper divisors (11412325).

53031515 is a wasteful number, since it uses less digits than its factorization.

53031515 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 134341.

The product of its (nonzero) digits is 1125, while the sum is 23.

The square root of 53031515 is about 7282.2740267035. The cubic root of 53031515 is about 375.7030130885.

The spelling of 53031515 in words is "fifty-three million, thirty-one thousand, five hundred fifteen".

Divisors: 1 5 79 395 134257 671285 10606303 53031515