101119999957 has 2 divisors, whose sum is σ = 101119999958. Its totient is φ = 101119999956.

The previous prime is 101119999867. The next prime is 101119999961. The reversal of 101119999957 is 759999911101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100621549681 + 498450276 = 317209^2 + 22326^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2^101119999957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2066715, while the sum is 61.

The spelling of 101119999957 in words is "one hundred one billion, one hundred nineteen million, nine hundred ninety-nine thousand, nine hundred fifty-seven".