Search a number
-
+
100111106999957 is a prime number
BaseRepresentation
bin10110110000110011101110…
…111110001000011010010101
3111010110112021011201221010012
4112300303232332020122111
5101110210021342444312
6552530224015210005
730041534362101644
oct2660635676103225
9433415234657105
10100111106999957
1129997978012789
12b28a253216905
1343b258aaa49c1
141aa159103735b
15b891bdb82322
hex5b0ceef88695

100111106999957 has 2 divisors, whose sum is σ = 100111106999958. Its totient is φ = 100111106999956.

The previous prime is 100111106999951. The next prime is 100111106999971. The reversal of 100111106999957 is 759999601111001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 94891737255121 + 5219369744836 = 9741239^2 + 2284594^2 .

It is a cyclic number.

It is not a de Polignac number, because 100111106999957 - 228 = 100110838564501 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2100111106999957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1377810, while the sum is 59.

The spelling of 100111106999957 in words is "one hundred trillion, one hundred eleven billion, one hundred six million, nine hundred ninety-nine thousand, nine hundred fifty-seven".