5100909141 has 4 divisors (see below), whose sum is σ = 6801212192. Its totient is φ = 3400606092.

The previous prime is 5100909139. The next prime is 5100909169. The reversal of 5100909141 is 1419090015.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 5100909141 - 2¹ = 5100909139 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 5100909099 and 5100909108.

It is a congruent number.

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

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

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

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

Almost surely, 2^5100909141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1700303050.

The product of its (nonzero) digits is 1620, while the sum is 30.

The square root of 5100909141 is about 71420.6492619606. The cubic root of 5100909141 is about 1721.4028960197.

Adding to 5100909141 its reverse (1419090015), we get a palindrome (6519999156).

The spelling of 5100909141 in words is "five billion, one hundred million, nine hundred nine thousand, one hundred forty-one".