10500765 has 32 divisors (see below), whose sum is σ = 19132416. Its totient is φ = 4868160.

The previous prime is 10500757. The next prime is 10500767. The reversal of 10500765 is 56700501.

It is not a de Polignac number, because 10500765 - 2³ = 10500757 is a prime.

It is a super-2 number, since 2×10500765² = 220532131170450, which contains 22 as substring.

It is a Curzon number.

It is a nialpdrome in base 15.

It is a congruent number.

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

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

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

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

Almost surely, 2^10500765 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 2809.

The product of its (nonzero) digits is 1050, while the sum is 24.

The square root of 10500765 is about 3240.4883891167. The cubic root of 10500765 is about 218.9812748528.

The spelling of 10500765 in words is "ten million, five hundred thousand, seven hundred sixty-five".