10642257010 has 64 divisors (see below), whose sum is σ = 25139911680. Its totient is φ = 3142480320.

The previous prime is 10642256959. The next prime is 10642257011. The reversal of 10642257010 is 1075224601.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 10642257010.

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

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

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

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

Almost surely, 2^10642257010 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 727471.

The product of its (nonzero) digits is 3360, while the sum is 28.

The spelling of 10642257010 in words is "ten billion, six hundred forty-two million, two hundred fifty-seven thousand, ten".