Search a number
-
+
32110111312157 is a prime number
BaseRepresentation
bin1110100110100001101111…
…10001110100100100011101
311012200200210212101211101202
413103100313301310210131
513202043001443442112
6152143103111445245
76522610330533044
oct723206761644435
9135620725354352
1032110111312157
11a25a9047aa46a
1237271a3386825
1314bbc80274ba8
147d01cdb1755b
153aa3cea3a6c2
hex1d3437c7491d

32110111312157 has 2 divisors, whose sum is σ = 32110111312158. Its totient is φ = 32110111312156.

The previous prime is 32110111312067. The next prime is 32110111312171. The reversal of 32110111312157 is 75121311101123.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31523946515161 + 586164796996 = 5614619^2 + 765614^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-32110111312157 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 232110111312157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1260, while the sum is 29.

The spelling of 32110111312157 in words is "thirty-two trillion, one hundred ten billion, one hundred eleven million, three hundred twelve thousand, one hundred fifty-seven".