10146709 has 4 divisors (see below), whose sum is σ = 10153120. Its totient is φ = 10140300.

The previous prime is 10146707. The next prime is 10146713. The reversal of 10146709 is 90764101.

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, and also a brilliant number, because the two primes have the same length.

It is a cyclic number.

It is not a de Polignac number, because 10146709 - 2¹ = 10146707 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10146707) 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, 1072 + ... + 4630.

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

Almost surely, 2^10146709 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6410.

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

The square root of 10146709 is about 3185.3899290354. The cubic root of 10146709 is about 216.4919414495.

The spelling of 10146709 in words is "ten million, one hundred forty-six thousand, seven hundred nine".