10490711960 has 32 divisors (see below), whose sum is σ = 23888496240. Its totient is φ = 4145725824.

The previous prime is 10490711947. The next prime is 10490711989. The reversal of 10490711960 is 6911709401.

10490711960 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×10490711960² (a number of 21 digits) contains 22 as substring.

It is a congruent number.

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, 1576607 + ... + 1583246.

Almost surely, 2^10490711960 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

The sum of its prime factors is 3159947 (or 3159943 counting only the distinct ones).

The product of its (nonzero) digits is 13608, while the sum is 38.

The spelling of 10490711960 in words is "ten billion, four hundred ninety million, seven hundred eleven thousand, nine hundred sixty".