Search a number
-
+
5000011156651 = 71937594068847
BaseRepresentation
bin100100011000010011111…
…1000111000110010101011
3122200222220101002221110111
41020300213320320302223
51123410010324003101
614344550131355151
71024144636406620
oct110604770706253
918628811087414
105000011156651
111658546a47735
12689051752ab7
132a366449c434
1413400504c347
158a0dd6c7251
hex48c27e38cab

5000011156651 has 8 divisors (see below), whose sum is σ = 6015051015680. Its totient is φ = 4060159435368.

The previous prime is 5000011156619. The next prime is 5000011156687. The reversal of 5000011156651 is 1566511100005.

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 5000011156651 - 25 = 5000011156619 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (5000011156691) 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, 18797034291 + ... + 18797034556.

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

Almost surely, 25000011156651 is an apocalyptic number.

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

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

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

The sum of its prime factors is 37594068873.

The product of its (nonzero) digits is 4500, while the sum is 31.

Adding to 5000011156651 its reverse (1566511100005), we get a palindrome (6566522256656).

The spelling of 5000011156651 in words is "five trillion, eleven million, one hundred fifty-six thousand, six hundred fifty-one".

Divisors: 1 7 19 133 37594068847 263158481929 714287308093 5000011156651