106946141 has 2 divisors, whose sum is σ = 106946142. Its totient is φ = 106946140.

The previous prime is 106946131. The next prime is 106946207. The reversal of 106946141 is 141649601.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 103449241 + 3496900 = 10171^2 + 1870^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-106946141 is a prime.

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

It is a Chen prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (106946101) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53473070 + 53473071.

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

Almost surely, 2^106946141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5184, while the sum is 32.

The square root of 106946141 is about 10341.4767320726. The cubic root of 106946141 is about 474.6662712139. Note that the first 3 decimals are identical.

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