Search a number
-
+
53047950 = 2352353653
BaseRepresentation
bin1100101001011…
…1001010001110
310200211010002220
43022113022032
5102040013300
65133000210
71212620514
oct312271216
9120733086
1053047950
1127a4278a
1215923066
13acb4827
14708c4b4
1549ccda0
hex329728e

53047950 has 24 divisors (see below), whose sum is σ = 131559288. Its totient is φ = 14146080.

The previous prime is 53047949. The next prime is 53047999. The reversal of 53047950 is 5974035.

53047950 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 11 ways as a sum of consecutive naturals, for example, 176677 + ... + 176976.

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

Almost surely, 253047950 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 18900, while the sum is 33.

The square root of 53047950 is about 7283.4023642800. The cubic root of 53047950 is about 375.7418204610.

The spelling of 53047950 in words is "fifty-three million, forty-seven thousand, nine hundred fifty".

Divisors: 1 2 3 5 6 10 15 25 30 50 75 150 353653 707306 1060959 1768265 2121918 3536530 5304795 8841325 10609590 17682650 26523975 53047950