Search a number
-
+
106815339157 is a prime number
BaseRepresentation
bin110001101111010110…
…0001011101010010101
3101012201010220102222111
41203132230023222111
53222224211323112
6121023103231021
710500661254652
oct1433654135225
9335633812874
10106815339157
11413335242aa
12188502a8471
13a0c379c1c7
14525426cc29
152ba27295a7
hex18deb0ba95

106815339157 has 2 divisors, whose sum is σ = 106815339158. Its totient is φ = 106815339156.

The previous prime is 106815339149. The next prime is 106815339161. The reversal of 106815339157 is 751933518601.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 106611392196 + 203946961 = 326514^2 + 14281^2 .

It is a cyclic number.

It is not a de Polignac number, because 106815339157 - 23 = 106815339149 is a prime.

It is a super-2 number, since 2×1068153391572 (a number of 23 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 106815339157.

It is a congruent number.

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

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

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

Almost surely, 2106815339157 is an apocalyptic number.

It is an amenable number.

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

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

106815339157 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 680400, while the sum is 49.

The spelling of 106815339157 in words is "one hundred six billion, eight hundred fifteen million, three hundred thirty-nine thousand, one hundred fifty-seven".