Search a number
-
+
53109569 = 151509691
BaseRepresentation
bin1100101010011…
…0001101000001
310200221020122002
43022212031001
5102044001234
65134153345
71213265252
oct312461501
9120836562
1053109569
1127a85007
1215952855
13b0068a6
1470a6b29
1549e127e
hex32a6341

53109569 has 8 divisors (see below), whose sum is σ = 53643840. Its totient is φ = 52578000.

The previous prime is 53109559. The next prime is 53109583. The reversal of 53109569 is 96590135.

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-53109569 is a prime.

It is a super-2 number, since 2×531095692 = 5641252638731522, which contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (53109559) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76514 + ... + 77204.

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

Almost surely, 253109569 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1351.

The product of its (nonzero) digits is 36450, while the sum is 38.

The square root of 53109569 is about 7287.6312338098. The cubic root of 53109569 is about 375.8872478618.

The spelling of 53109569 in words is "fifty-three million, one hundred nine thousand, five hundred sixty-nine".

Divisors: 1 151 509 691 76859 104341 351719 53109569