Search a number
-
+
50005050001 = 291724312069
BaseRepresentation
bin101110100100100010…
…001000001010010001
311210001221022201220221
4232210202020022101
51304402243100001
634545541433041
73420112624534
oct564442101221
9153057281827
1050005050001
111a230602205
12983670b781
13493bb1a4aa
1425c5286a1b
15147a0411a1
hexba4888291

50005050001 has 4 divisors (see below), whose sum is σ = 51729362100. Its totient is φ = 48280737904.

The previous prime is 50005049981. The next prime is 50005050023. The reversal of 50005050001 is 10005050005.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10005050005 = 52001010001.

It can be written as a sum of positive squares in 2 ways, for example, as 12592206225 + 37412843776 = 112215^2 + 193424^2 .

It is a cyclic number.

It is not a de Polignac number, because 50005050001 - 213 = 50005041809 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (50005050031) by changing a digit.

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

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

Almost surely, 250005050001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1724312098.

The product of its (nonzero) digits is 125, while the sum is 16.

The spelling of 50005050001 in words is "fifty billion, five million, fifty thousand, one".

Divisors: 1 29 1724312069 50005050001