5103251151141 has 64 divisors (see below), whose sum is σ = 8024288219136. Its totient is φ = 2844125894400.

The previous prime is 5103251151109. The next prime is 5103251151149. The reversal of 5103251151141 is 1411511523015.

It is not a de Polignac number, because 5103251151141 - 2⁵ = 5103251151109 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5103251151149) 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 63 ways as a sum of consecutive naturals, for example, 226689076 + ... + 226711586.

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

Almost surely, 2^{5103251151141} is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 24522.

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

Adding to 5103251151141 its reverse (1411511523015), we get a palindrome (6514762674156).

The spelling of 5103251151141 in words is "five trillion, one hundred three billion, two hundred fifty-one million, one hundred fifty-one thousand, one hundred forty-one".