1011020010157 has 2 divisors, whose sum is σ = 1011020010158. Its totient is φ = 1011020010156.

The previous prime is 1011020010109. The next prime is 1011020010193. The reversal of 1011020010157 is 7510100201101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 833594564196 + 177425445961 = 913014^2 + 421219^2 .

It is a cyclic number.

It is not a de Polignac number, because 1011020010157 - 2³⁹ = 461264196269 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1011020017157) 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, 505510005078 + 505510005079.

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 70, while the sum is 19.

Adding to 1011020010157 its reverse (7510100201101), we get a palindrome (8521120211258).

The spelling of 1011020010157 in words is "one trillion, eleven billion, twenty million, ten thousand, one hundred fifty-seven".