106935141 has 4 divisors (see below), whose sum is σ = 142580192. Its totient is φ = 71290092.

The previous prime is 106935133. The next prime is 106935163. The reversal of 106935141 is 141539601.

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 not a de Polignac number, because 106935141 - 2³ = 106935133 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 106935099 and 106935108.

It is a congruent number.

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

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

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

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

Almost surely, 2^106935141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 35645050.

The product of its (nonzero) digits is 3240, while the sum is 30.

The square root of 106935141 is about 10340.9448794585. The cubic root of 106935141 is about 474.6499966420.

The spelling of 106935141 in words is "one hundred six million, nine hundred thirty-five thousand, one hundred forty-one".