Search a number
-
+
100091520076661 is a prime number
BaseRepresentation
bin10110110000100001011111…
…011111111100101101110101
3111010101122201010111010120122
4112300201133133330231311
5101104344413114423121
6552513224243341325
730040242114022211
oct2660413737745565
9433348633433518
10100091520076661
112998a636780373
12b2864a7681845
1343b0788b69769
141aa065395b941
15b8892430e5ab
hex5b085f7fcb75

100091520076661 has 2 divisors, whose sum is σ = 100091520076662. Its totient is φ = 100091520076660.

The previous prime is 100091520076657. The next prime is 100091520076679. The reversal of 100091520076661 is 166670025190001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 57342074727025 + 42749445349636 = 7572455^2 + 6538306^2 .

It is an emirp because it is prime and its reverse (166670025190001) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 100091520076661 - 22 = 100091520076657 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2100091520076661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 136080, while the sum is 44.

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