101101109848957 has 2 divisors, whose sum is σ = 101101109848958. Its totient is φ = 101101109848956.

The previous prime is 101101109848951. The next prime is 101101109849017. The reversal of 101101109848957 is 759848901101101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 67056347174436 + 34044762674521 = 8188794^2 + 5834789^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-101101109848957 is a prime.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 725760, while the sum is 55.

The spelling of 101101109848957 in words is "one hundred one trillion, one hundred one billion, one hundred nine million, eight hundred forty-eight thousand, nine hundred fifty-seven".