10678132170131 has 2 divisors, whose sum is σ = 10678132170132. Its totient is φ = 10678132170130.

The previous prime is 10678132170113. The next prime is 10678132170151. The reversal of 10678132170131 is 13107123187601.

10678132170131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

Together with previous prime (10678132170113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is an emirp because it is prime and its reverse (13107123187601) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10678132170131 - 2⁶ = 10678132170067 is a prime.

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

It is a Sophie Germain prime.

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

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

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

Almost surely, 2^{10678132170131} is an apocalyptic number.

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

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

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

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

The spelling of 10678132170131 in words is "ten trillion, six hundred seventy-eight billion, one hundred thirty-two million, one hundred seventy thousand, one hundred thirty-one".