Search a number
-
+
53390610 = 23357134153
BaseRepresentation
bin1100101110101…
…0110100010010
310201110112011000
43023222310102
5102131444420
65144202430
71215545520
oct313526422
9121415130
1053390610
1128157179
1215a69416
13b0a47a0
14713b310
154a49690
hex32ead12

53390610 has 256 divisors, whose sum is σ = 182891520. Its totient is φ = 10782720.

The previous prime is 53390549. The next prime is 53390621. The reversal of 53390610 is 1609335.

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

It is a Harshad number since it is a multiple of its sum of digits (27).

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 127 ways as a sum of consecutive naturals, for example, 1007344 + ... + 1007396.

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

Almost surely, 253390610 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 53390610, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91445760).

53390610 is an abundant number, since it is smaller than the sum of its proper divisors (129500910).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 130 (or 124 counting only the distinct ones).

The product of its (nonzero) digits is 2430, while the sum is 27.

The square root of 53390610 is about 7306.8878464090. The cubic root of 53390610 is about 376.5491118614.

Adding to 53390610 its reverse (1609335), we get a palindrome (54999945).

The spelling of 53390610 in words is "fifty-three million, three hundred ninety thousand, six hundred ten".