106909151 has 2 divisors, whose sum is σ = 106909152. Its totient is φ = 106909150.

The previous prime is 106909147. The next prime is 106909177. The reversal of 106909151 is 151909601.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 106909151 - 2² = 106909147 is a prime.

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

It is a Sophie Germain prime.

It is equal to p_6135944 and since 106909151 and 6135944 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (106909951) 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, 53454575 + 53454576.

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

Almost surely, 2^106909151 is an apocalyptic number.

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

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

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

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

The square root of 106909151 is about 10339.6881481020. The cubic root of 106909151 is about 474.6115398327.

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