Search a number
-
+
53016065 = 510603213
BaseRepresentation
bin1100101000111…
…1011000000001
310200202111100222
43022033120001
5102033003230
65132152425
71212425534
oct312173001
9120674328
1053016065
1127a20833
1215908715
13aca316b
147080a1b
1549c36e5
hex328f601

53016065 has 4 divisors (see below), whose sum is σ = 63619284. Its totient is φ = 42412848.

The previous prime is 53015999. The next prime is 53016083. The reversal of 53016065 is 56061035.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 28344976 + 24671089 = 5324^2 + 4967^2 .

It is a cyclic number.

It is not a de Polignac number, because 53016065 - 210 = 53015041 is a prime.

It is a Duffinian number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 5301602 + ... + 5301611.

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

Almost surely, 253016065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10603218.

The product of its (nonzero) digits is 2700, while the sum is 26.

The square root of 53016065 is about 7281.2131544132. The cubic root of 53016065 is about 375.6665242489. Note that the first 3 decimals are identical.

The spelling of 53016065 in words is "fifty-three million, sixteen thousand, sixty-five".

Divisors: 1 5 10603213 53016065