10565149 has 4 divisors (see below), whose sum is σ = 12074464. Its totient is φ = 9055836.

The previous prime is 10565131. The next prime is 10565173. The reversal of 10565149 is 94156501.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 10565149 - 2⁷ = 10565021 is a prime.

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

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 10565149.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10565549) 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 3 ways as a sum of consecutive naturals, for example, 754647 + ... + 754660.

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

Almost surely, 2^10565149 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1509314.

The product of its (nonzero) digits is 5400, while the sum is 31.

The square root of 10565149 is about 3250.4075129128. The cubic root of 10565149 is about 219.4279144711.

The spelling of 10565149 in words is "ten million, five hundred sixty-five thousand, one hundred forty-nine".