101513768711647 has 2 divisors, whose sum is σ = 101513768711648. Its totient is φ = 101513768711646.

The previous prime is 101513768711617. The next prime is 101513768711717. The reversal of 101513768711647 is 746117867315101.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101513768711647 - 2⁷ = 101513768711519 is a prime.

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

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

It is a congruent number.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 5927040, while the sum is 58.

The spelling of 101513768711647 in words is "one hundred one trillion, five hundred thirteen billion, seven hundred sixty-eight million, seven hundred eleven thousand, six hundred forty-seven".