Search a number
-
+
50052565 = 510010513
BaseRepresentation
bin1011111011101…
…1110111010101
310111011221012201
42332323313111
5100303140230
64544444501
71145303563
oct276736725
9114157181
1050052565
1126287262
1214919731
13a4a6304
14690ca33
1545da5ca
hex2fbbdd5

50052565 has 4 divisors (see below), whose sum is σ = 60063084. Its totient is φ = 40042048.

The previous prime is 50052557. The next prime is 50052571. The reversal of 50052565 is 56525005.

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 34363044 + 15689521 = 5862^2 + 3961^2 .

It is a cyclic number.

It is not a de Polignac number, because 50052565 - 23 = 50052557 is a prime.

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5005252 + ... + 5005261.

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

Almost surely, 250052565 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10010518.

The product of its (nonzero) digits is 7500, while the sum is 28.

The square root of 50052565 is about 7074.7837422779. The cubic root of 50052565 is about 368.5322053931.

The spelling of 50052565 in words is "fifty million, fifty-two thousand, five hundred sixty-five".

Divisors: 1 5 10010513 50052565