10571115166151 has 16 divisors (see below), whose sum is σ = 11201216557440. Its totient is φ = 9948446399520.

The previous prime is 10571115166133. The next prime is 10571115166153. The reversal of 10571115166151 is 15166151117501.

It is a happy number.

It is not a de Polignac number, because 10571115166151 - 2¹⁴ = 10571115149767 is a prime.

It is a super-2 number, since 2×10571115166151² (a number of 27 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 = 10571115166099 and 10571115166108.

It is a congruent number.

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

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

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

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

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

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

The sum of its prime factors is 1664846.

The product of its (nonzero) digits is 31500, while the sum is 41.

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