Search a number
-
+
50010111051051 = 323371545223249
BaseRepresentation
bin10110101111011111000101…
…11001111000010100101011
320120001220211121212212200010
423113233202321320110223
523023331201412113201
6254210154452143003
713351053113063064
oct1327574271702453
9216056747785603
1050010111051051
1114a31194a22428
125738365007a63
1321b9c19423018
14c4c7063d756b
155bad27656bd6
hex2d7be2e7852b

50010111051051 has 8 divisors (see below), whose sum is σ = 66966328962000. Its totient is φ = 33196983587072.

The previous prime is 50010111051029. The next prime is 50010111051077. The reversal of 50010111051051 is 15015011101005.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 50010111051051 - 26 = 50010111050987 is a prime.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35772610926 + ... + 35772612323.

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

Almost surely, 250010111051051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 71545223485.

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

Adding to 50010111051051 its reverse (15015011101005), we get a palindrome (65025122152056).

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

Divisors: 1 3 233 699 71545223249 214635669747 16670037017017 50010111051051