109670713151 has 2 divisors, whose sum is σ = 109670713152. Its totient is φ = 109670713150.

The previous prime is 109670713147. The next prime is 109670713183. The reversal of 109670713151 is 151317076901.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 109670713151 - 2² = 109670713147 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2^109670713151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 39690, while the sum is 41.

The spelling of 109670713151 in words is "one hundred nine billion, six hundred seventy million, seven hundred thirteen thousand, one hundred fifty-one".