Search a number
-
+
53046535 = 516196553
BaseRepresentation
bin1100101001011…
…0110100000111
310200211001011111
43022112310013
5102034442120
65132545451
71212613423
oct312266407
9120731144
1053046535
1127a41713
1215922287
13acb3ca9
14708bb83
1549cc75a
hex3296d07

53046535 has 8 divisors (see below), whose sum is σ = 63704880. Its totient is φ = 42404544.

The previous prime is 53046527. The next prime is 53046541. The reversal of 53046535 is 53564035.

53046535 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 53046535 - 23 = 53046527 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 53046497 and 53046506.

It is a congruent number.

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, 4819 + ... + 11371.

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

Almost surely, 253046535 is an apocalyptic number.

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

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

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

The sum of its prime factors is 8177.

The product of its (nonzero) digits is 27000, while the sum is 31.

The square root of 53046535 is about 7283.3052249648. The cubic root of 53046535 is about 375.7384795879.

The spelling of 53046535 in words is "fifty-three million, forty-six thousand, five hundred thirty-five".

Divisors: 1 5 1619 6553 8095 32765 10609307 53046535