Search a number
-
+
50505052 = 2213971251
BaseRepresentation
bin1100000010101…
…0010101011100
310112000220220111
43000222111130
5100412130202
65002255404
71152200023
oct300522534
9115026814
1050505052
1126566214
1214ab7564
13a604260
1469c98ba
1546796d7
hex302a55c

50505052 has 12 divisors (see below), whose sum is σ = 95182696. Its totient is φ = 23310000.

The previous prime is 50505047. The next prime is 50505053. The reversal of 50505052 is 25050505.

It is an alternating number because its digits alternate between odd and even.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (50505053) 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 3 ways as a sum of consecutive naturals, for example, 485574 + ... + 485677.

Almost surely, 250505052 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 971268 (or 971266 counting only the distinct ones).

The product of its (nonzero) digits is 1250, while the sum is 22.

The square root of 50505052 is about 7106.6906503660. The cubic root of 50505052 is about 369.6394149572.

Adding to 50505052 its reverse (25050505), we get a palindrome (75555557).

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

Divisors: 1 2 4 13 26 52 971251 1942502 3885004 12626263 25252526 50505052