107127015641 has 2 divisors, whose sum is σ = 107127015642. Its totient is φ = 107127015640.

The previous prime is 107127015607. The next prime is 107127015647. The reversal of 107127015641 is 146510721701.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 55969623241 + 51157392400 = 236579^2 + 226180^2 .

It is a cyclic number.

It is not a de Polignac number, because 107127015641 - 2³⁰ = 106053273817 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2^107127015641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11760, while the sum is 35.

The spelling of 107127015641 in words is "one hundred seven billion, one hundred twenty-seven million, fifteen thousand, six hundred forty-one".