Search a number
-
+
53252950 = 2521065059
BaseRepresentation
bin1100101100100…
…1001101010110
310201012112022111
43023021031112
5102113043300
65141221234
71214433262
oct313111526
9121175274
1053252950
1128072803
1215a0181a
13b056c2a
1471030a2
154a1d9ba
hex32c9356

53252950 has 12 divisors (see below), whose sum is σ = 99050580. Its totient is φ = 21301160.

The previous prime is 53252923. The next prime is 53252951. The reversal of 53252950 is 5925235.

53252950 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 not an unprimeable number, because it can be changed into a prime (53252951) 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 5 ways as a sum of consecutive naturals, for example, 532480 + ... + 532579.

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

Almost surely, 253252950 is an apocalyptic number.

53252950 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

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

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

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

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

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

The square root of 53252950 is about 7297.4618875332. The cubic root of 53252950 is about 376.2252074332.

The spelling of 53252950 in words is "fifty-three million, two hundred fifty-two thousand, nine hundred fifty".

Divisors: 1 2 5 10 25 50 1065059 2130118 5325295 10650590 26626475 53252950