15500166051131 has 2 divisors, whose sum is σ = 15500166051132. Its totient is φ = 15500166051130.

The previous prime is 15500166051127. The next prime is 15500166051157. The reversal of 15500166051131 is 13115066100551.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 15500166051131 - 2² = 15500166051127 is a prime.

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

It is a Sophie Germain prime.

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

It is not a weakly prime, because it can be changed into another prime (15500166051191) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7750083025565 + 7750083025566.

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

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

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

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

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

The product of its (nonzero) digits is 13500, while the sum is 35.

The spelling of 15500166051131 in words is "fifteen trillion, five hundred billion, one hundred sixty-six million, fifty-one thousand, one hundred thirty-one".