Search a number
-
+
50001110051 = 69777166563
BaseRepresentation
bin101110100100010011…
…000110010000100011
311210001122220120022212
4232210103012100203
51304400241010201
634545321152335
73420034265024
oct564423062043
9153048816285
1050001110051
111a229361052
12983532b6ab
13493b06b069
1425c493cc4b
151479a13abb
hexba44c6423

50001110051 has 4 divisors (see below), whose sum is σ = 50008283592. Its totient is φ = 49993936512.

The previous prime is 50001110009. The next prime is 50001110083. The reversal of 50001110051 is 15001110005.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-50001110051 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 250001110051 is an apocalyptic number.

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

50001110051 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 7173540.

The product of its (nonzero) digits is 25, while the sum is 14.

Adding to 50001110051 its reverse (15001110005), we get a palindrome (65002220056).

The spelling of 50001110051 in words is "fifty billion, one million, one hundred ten thousand, fifty-one".

Divisors: 1 6977 7166563 50001110051