Search a number
-
+
53015132 = 22294171157
BaseRepresentation
bin1100101000111…
…1001001011100
310200202110002102
43022033021130
5102032441012
65132144232
71212423032
oct312171134
9120673072
1053015132
1127a20065
1215908078
13aca2901
147080552
1549c32c2
hex328f25c

53015132 has 48 divisors (see below), whose sum is σ = 100336320. Its totient is φ = 24460800.

The previous prime is 53015119. The next prime is 53015141. The reversal of 53015132 is 23151035.

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

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 15 ways as a sum of consecutive naturals, for example, 337598 + ... + 337754.

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

Almost surely, 253015132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 450, while the sum is 20.

The square root of 53015132 is about 7281.1490851376. The cubic root of 53015132 is about 375.6643205211.

Adding to 53015132 its reverse (23151035), we get a palindrome (76166167).

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

Divisors: 1 2 4 29 41 58 71 82 116 142 157 164 284 314 628 1189 2059 2378 2911 4118 4553 4756 5822 6437 8236 9106 11147 11644 12874 18212 22294 25748 44588 84419 168838 186673 323263 337676 373346 457027 646526 746692 914054 1293052 1828108 13253783 26507566 53015132