Search a number
-
+
100091476522001 is a prime number
BaseRepresentation
bin10110110000100001011100…
…111001110011010000010001
3111010101122121002112022211002
4112300201130321303100101
5101104344320442201001
6552513220050031345
730040241044560536
oct2660413471632021
9433348532468732
10100091476522001
112998a614132088
12b286494b78555
1343b077cb29c83
141aa064bc60d8d
15b889205a946b
hex5b085ce73411

100091476522001 has 2 divisors, whose sum is σ = 100091476522002. Its totient is φ = 100091476522000.

The previous prime is 100091476521973. The next prime is 100091476522039. The reversal of 100091476522001 is 100225674190001.

It is an a-pointer prime, because the next prime (100091476522039) can be obtained adding 100091476522001 to its sum of digits (38).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 99959024198401 + 132452323600 = 9997951^2 + 363940^2 .

It is a cyclic number.

It is not a de Polignac number, because 100091476522001 - 238 = 99816598615057 is a prime.

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

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

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

Almost surely, 2100091476522001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30240, while the sum is 38.

The spelling of 100091476522001 in words is "one hundred trillion, ninety-one billion, four hundred seventy-six million, five hundred twenty-two thousand, one".