10642111 has 4 divisors (see below), whose sum is σ = 10648800. Its totient is φ = 10635424.

The previous prime is 10642103. The next prime is 10642117. The reversal of 10642111 is 11124601.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 11124601 = 2237 ⋅4973.

It is a cyclic number.

It is not a de Polignac number, because 10642111 - 2³ = 10642103 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2^10642111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6688.

The product of its (nonzero) digits is 48, while the sum is 16.

The square root of 10642111 is about 3262.2248542981. The cubic root of 10642111 is about 219.9594346695.

Adding to 10642111 its reverse (11124601), we get a palindrome (21766712).

The spelling of 10642111 in words is "ten million, six hundred forty-two thousand, one hundred eleven".