10690151 has 12 divisors (see below), whose sum is σ = 11302872. Its totient is φ = 10101744.

The previous prime is 10690123. The next prime is 10690157. The reversal of 10690151 is 15109601.

It is not a de Polignac number, because 10690151 - 2⁶ = 10690087 is a prime.

It is a super-2 number, since 2×10690151² = 228558656805602, 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 (10690157) 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 11 ways as a sum of consecutive naturals, for example, 128756 + ... + 128838.

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

Almost surely, 2^10690151 is an apocalyptic number.

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

10690151 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 238 (or 179 counting only the distinct ones).

The product of its (nonzero) digits is 270, while the sum is 23.

The square root of 10690151 is about 3269.5796365894. The cubic root of 10690151 is about 220.2899139296.

Adding to 10690151 its reverse (15109601), we get a palindrome (25799752).

The spelling of 10690151 in words is "ten million, six hundred ninety thousand, one hundred fifty-one".