101000942901037 has 2 divisors, whose sum is σ = 101000942901038. Its totient is φ = 101000942901036.

The previous prime is 101000942900989. The next prime is 101000942901073. The reversal of 101000942901037 is 730109249000101.

Together with next prime (101000942901073) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100821801492036 + 179141409001 = 10041006^2 + 423251^2 .

It is a cyclic number.

It is not a de Polignac number, because 101000942901037 - 2³¹ = 100998795417389 is a prime.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13608, while the sum is 37.

The spelling of 101000942901037 in words is "one hundred one trillion, nine hundred forty-two million, nine hundred one thousand, thirty-seven".