Search a number
-
+
50275005 = 3511535749
BaseRepresentation
bin1011111111001…
…0001010111101
310111121020100020
42333302022331
5100332300010
64553322353
71150221234
oct277621275
9114536306
1050275005
11264193a0
1214a063b9
13a553631
146969b1b
154631470
hex2ff22bd

50275005 has 32 divisors (see below), whose sum is σ = 89424000. Its totient is φ = 23911680.

The previous prime is 50274989. The next prime is 50275013. The reversal of 50275005 is 50057205.

It is not a de Polignac number, because 50275005 - 24 = 50274989 is a prime.

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

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5871 + ... + 11619.

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

Almost surely, 250275005 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 5821.

The product of its (nonzero) digits is 1750, while the sum is 24.

The square root of 50275005 is about 7090.4869367343. The cubic root of 50275005 is about 369.0773333999.

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

Divisors: 1 3 5 11 15 33 53 55 159 165 265 583 795 1749 2915 5749 8745 17247 28745 63239 86235 189717 304697 316195 914091 948585 1523485 3351667 4570455 10055001 16758335 50275005