Search a number
-
+
50001050051 = 447531117267
BaseRepresentation
bin101110100100010010…
…110111100111000011
311210001122210112000122
4232210102313213003
51304400232100201
634545320010455
73420033625061
oct564422674703
9153048715018
1050001050051
111a22931aa67
129835300a2b
13493b049964
1425c4925031
151479a00e1b
hexba44b79c3

50001050051 has 4 divisors (see below), whose sum is σ = 50002212072. Its totient is φ = 49999888032.

The previous prime is 50001050017. The next prime is 50001050053. The reversal of 50001050051 is 15005010005.

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

It is a cyclic number.

It is not a de Polignac number, because 50001050051 - 234 = 32821180867 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 250001050051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1162020.

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

Adding to 50001050051 its reverse (15005010005), we get a palindrome (65006060056).

The spelling of 50001050051 in words is "fifty billion, one million, fifty thousand, fifty-one".

Divisors: 1 44753 1117267 50001050051