Search a number
-
+
53047605 = 3513272039
BaseRepresentation
bin1100101001011…
…1000100110101
310200211002122010
43022113010311
5102040010410
65132554433
71212616512
oct312270465
9120732563
1053047605
1127a424a6
1215922a19
13acb4620
14708c309
1549ccc20
hex3297135

53047605 has 16 divisors (see below), whose sum is σ = 91405440. Its totient is φ = 26115648.

The previous prime is 53047597. The next prime is 53047609. The reversal of 53047605 is 50674035.

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

It is not a de Polignac number, because 53047605 - 23 = 53047597 is a prime.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (53047609) 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 in 15 ways as a sum of consecutive naturals, for example, 135825 + ... + 136214.

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

Almost surely, 253047605 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 272060.

The product of its (nonzero) digits is 12600, while the sum is 30.

The square root of 53047605 is about 7283.3786802555. The cubic root of 53047605 is about 375.7410059073.

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

Divisors: 1 3 5 13 15 39 65 195 272039 816117 1360195 3536507 4080585 10609521 17682535 53047605