Search a number
-
+
51015141113 = 192992586463
BaseRepresentation
bin101111100000101111…
…010100011011111001
311212200022222200102212
4233200233110123321
51313434334003423
635234103304505
73454126354556
oct574057243371
9155608880385
1051015141113
111a6a9798652
129a78a4b135
134a7017b841
14267d49da2d
1514d8a67578
hexbe0bd46f9

51015141113 has 8 divisors (see below), whose sum is σ = 55551878400. Its totient is φ = 46663576848.

The previous prime is 51015141091. The next prime is 51015141119. The reversal of 51015141113 is 31114151015.

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 51015141113 - 28 = 51015140857 is a prime.

It is a Duffinian number.

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

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

Almost surely, 251015141113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 92586511.

The product of its (nonzero) digits is 300, while the sum is 23.

Adding to 51015141113 its reverse (31114151015), we get a palindrome (82129292128).

The spelling of 51015141113 in words is "fifty-one billion, fifteen million, one hundred forty-one thousand, one hundred thirteen".

Divisors: 1 19 29 551 92586463 1759142797 2685007427 51015141113