Search a number
-
+
53055851 = 432574801
BaseRepresentation
bin1100101001100…
…1000101101011
310200211111221112
43022121011223
5102040241401
65133100535
71212652532
oct312310553
9120744845
1053055851
1127a48712
121592774b
13acb82c4
147091319
1549d03bb
hex329916b

53055851 has 8 divisors (see below), whose sum is σ = 54512304. Its totient is φ = 51609600.

The previous prime is 53055839. The next prime is 53055857. The reversal of 53055851 is 15855035.

53055851 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 a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-53055851 is a prime.

It is not an unprimeable number, because it can be changed into a prime (53055857) 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, 8651 + ... + 13451.

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

Almost surely, 253055851 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5101.

The product of its (nonzero) digits is 15000, while the sum is 32.

The square root of 53055851 is about 7283.9447416905. The cubic root of 53055851 is about 375.7604739543.

The spelling of 53055851 in words is "fifty-three million, fifty-five thousand, eight hundred fifty-one".

Divisors: 1 43 257 4801 11051 206443 1233857 53055851