10905371 has 4 divisors (see below), whose sum is σ = 10977744. Its totient is φ = 10833000.

The previous prime is 10905353. The next prime is 10905379. The reversal of 10905371 is 17350901.

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

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-10905371 is a prime.

It is a Duffinian number.

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

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35960 + ... + 36261.

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

Almost surely, 2^10905371 is an apocalyptic number.

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

10905371 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 72372.

The product of its (nonzero) digits is 945, while the sum is 26.

The square root of 10905371 is about 3302.3281181615. The cubic root of 10905371 is about 221.7584351284.

The spelling of 10905371 in words is "ten million, nine hundred five thousand, three hundred seventy-one".