901100100113 has 2 divisors, whose sum is σ = 901100100114. Its totient is φ = 901100100112.

The previous prime is 901100100079. The next prime is 901100100119. The reversal of 901100100113 is 311001001109.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 810374443264 + 90725656849 = 900208^2 + 301207^2 .

It is a cyclic number.

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

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

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

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

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

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

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

Almost surely, 2^901100100113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 17.

The spelling of 901100100113 in words is "nine hundred one billion, one hundred million, one hundred thousand, one hundred thirteen".