10496131770 has 16 divisors (see below), whose sum is σ = 25190716320. Its totient is φ = 2798968464.

The previous prime is 10496131747. The next prime is 10496131813. The reversal of 10496131770 is 7713169401.

10496131770 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 174935500 + ... + 174935559.

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

Almost surely, 2^10496131770 is an apocalyptic number.

10496131770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

10496131770 is an abundant number, since it is smaller than the sum of its proper divisors (14694584550).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 349871069.

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

The spelling of 10496131770 in words is "ten billion, four hundred ninety-six million, one hundred thirty-one thousand, seven hundred seventy".