10131505169 has 4 divisors (see below), whose sum is σ = 10131903600. Its totient is φ = 10131106740.

The previous prime is 10131505159. The next prime is 10131505177. The reversal of 10131505169 is 96150513101.

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, and also an emirpimes, since its reverse is a distinct semiprime: 96150513101 = 499 ⋅192686399.

It is a cyclic number.

It is not a de Polignac number, because 10131505169 - 2⁸ = 10131504913 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2^10131505169 is an apocalyptic number.

It is an amenable number.

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

10131505169 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 398430.

The product of its (nonzero) digits is 4050, while the sum is 32.

The spelling of 10131505169 in words is "ten billion, one hundred thirty-one million, five hundred five thousand, one hundred sixty-nine".