Search a number
-
+
50001110605 = 510000222121
BaseRepresentation
bin101110100100010011…
…000110011001001101
311210001122220121002101
4232210103012121031
51304400241014410
634545321155101
73420034266445
oct564423063115
9153048817071
1050001110605
111a229361506
12983532ba91
13493b06b3a4
1425c493d125
151479a13d3a
hexba44c664d

50001110605 has 4 divisors (see below), whose sum is σ = 60001332732. Its totient is φ = 40000888480.

The previous prime is 50001110591. The next prime is 50001110623. The reversal of 50001110605 is 50601110005.

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

It can be written as a sum of positive squares in 2 ways, for example, as 22004458921 + 27996651684 = 148339^2 + 167322^2 .

It is not a de Polignac number, because 50001110605 - 25 = 50001110573 is a prime.

It is a super-2 number, since 2×500011106052 (a number of 22 digits) contains 22 as substring.

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 (17) of ones.

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

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

Almost surely, 250001110605 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10000222126.

The product of its (nonzero) digits is 150, while the sum is 19.

The spelling of 50001110605 in words is "fifty billion, one million, one hundred ten thousand, six hundred five".

Divisors: 1 5 10000222121 50001110605