Search a number
-
+
100091476521961 is a prime number
BaseRepresentation
bin10110110000100001011100…
…111001110011001111101001
3111010101122121002112022202121
4112300201130321303033221
5101104344320442200321
6552513220050031241
730040241044560451
oct2660413471631751
9433348532468677
10100091476521961
112998a614132051
12b286494b78521
1343b077cb29c52
141aa064bc60d61
15b889205a9441
hex5b085ce733e9

100091476521961 has 2 divisors, whose sum is σ = 100091476521962. Its totient is φ = 100091476521960.

The previous prime is 100091476521941. The next prime is 100091476521973. The reversal of 100091476521961 is 169125674190001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 99633716025561 + 457760496400 = 9981669^2 + 676580^2 .

It is a cyclic number.

It is not a de Polignac number, because 100091476521961 - 241 = 97892453266409 is a prime.

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

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

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

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

Almost surely, 2100091476521961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 816480, while the sum is 52.

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