10500161506491 has 32 divisors (see below), whose sum is σ = 14914515965440. Its totient is φ = 6552127148544.

The previous prime is 10500161506481. The next prime is 10500161506531. The reversal of 10500161506491 is 19460516100501.

It is not a de Polignac number, because 10500161506491 - 2⁷ = 10500161506363 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10500161506481) by changing a digit.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 476925 + ... + 4607361.

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

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

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

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

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

The sum of its prime factors is 4130995.

The product of its (nonzero) digits is 32400, while the sum is 39.

Adding to 10500161506491 its reverse (19460516100501), we get a palindrome (29960677606992).

The spelling of 10500161506491 in words is "ten trillion, five hundred billion, one hundred sixty-one million, five hundred six thousand, four hundred ninety-one".