106932085147 has 2 divisors, whose sum is σ = 106932085148. Its totient is φ = 106932085146.

The previous prime is 106932085123. The next prime is 106932085201. The reversal of 106932085147 is 741580239601.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 106932085147 - 2¹¹ = 106932083099 is a prime.

It is a super-2 number, since 2×106932085147² (a number of 23 digits) contains 22 as substring.

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅106932085147 = 213864170294 is not.

Almost surely, 2^106932085147 is an apocalyptic number.

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

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

106932085147 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 362880, while the sum is 46.

The spelling of 106932085147 in words is "one hundred six billion, nine hundred thirty-two million, eighty-five thousand, one hundred forty-seven".