15214010131 has 16 divisors (see below), whose sum is σ = 16227188640. Its totient is φ = 14236508160.

The previous prime is 15214010113. The next prime is 15214010137. The reversal of 15214010131 is 13101041251.

It is a cyclic number.

It is not a de Polignac number, because 15214010131 - 2⁷ = 15214010003 is a prime.

It is a super-2 number, since 2×15214010131² (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

Almost surely, 2^15214010131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55494.

The product of its (nonzero) digits is 120, while the sum is 19.

Adding to 15214010131 its reverse (13101041251), we get a palindrome (28315051382).

The spelling of 15214010131 in words is "fifteen billion, two hundred fourteen million, ten thousand, one hundred thirty-one".