Search a number
-
+
50505565 = 511918283
BaseRepresentation
bin1100000010101…
…0011101011101
310112000221121111
43000222131131
5100412134230
65002302021
71152201355
oct300523535
9115027544
1050505565
1126566640
1214ab7911
13a604566
1469c9b65
15467992a
hex302a75d

50505565 has 8 divisors (see below), whose sum is σ = 66116448. Its totient is φ = 36731280.

The previous prime is 50505551. The next prime is 50505571. The reversal of 50505565 is 56550505.

50505565 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 not a de Polignac number, because 50505565 - 29 = 50505053 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 (13) of ones.

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

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

Almost surely, 250505565 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 918299.

The product of its (nonzero) digits is 18750, while the sum is 31.

The square root of 50505565 is about 7106.7267430231. The cubic root of 50505565 is about 369.6406664781.

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

Divisors: 1 5 11 55 918283 4591415 10101113 50505565