Search a number
-
+
53025141 = 3131359619
BaseRepresentation
bin1100101001000…
…1100101110101
310200202221211010
43022101211311
5102033301031
65132302433
71212464151
oct312214565
9120687733
1053025141
1127a27634
1215911a19
13aca7330
147084061
1549c6246
hex3291975

53025141 has 8 divisors (see below), whose sum is σ = 76138720. Its totient is φ = 32630832.

The previous prime is 53025127. The next prime is 53025151. The reversal of 53025141 is 14152035.

53025141 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 not a de Polignac number, because 53025141 - 25 = 53025109 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 253025141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1359635.

The product of its (nonzero) digits is 600, while the sum is 21.

The square root of 53025141 is about 7281.8363755306. The cubic root of 53025141 is about 375.6879602346.

Adding to 53025141 its reverse (14152035), we get a palindrome (67177176).

The spelling of 53025141 in words is "fifty-three million, twenty-five thousand, one hundred forty-one".

Divisors: 1 3 13 39 1359619 4078857 17675047 53025141