10638664147 has 2 divisors, whose sum is σ = 10638664148. Its totient is φ = 10638664146.

The previous prime is 10638664067. The next prime is 10638664159. The reversal of 10638664147 is 74146683601.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10638664147 - 2⁷ = 10638664019 is a prime.

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

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2^10638664147 is an apocalyptic number.

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

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

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

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

The spelling of 10638664147 in words is "ten billion, six hundred thirty-eight million, six hundred sixty-four thousand, one hundred forty-seven".