Search a number
-
+
117188928397 is a prime number
BaseRepresentation
bin110110100100100000…
…0010010001110001101
3102012111002122101012101
41231021000102032031
53410000331202042
6125500313235101
711316023312242
oct1551100221615
9365432571171
10117188928397
1145777105452
121a866402a91
13b0879b18a8
145959c7d5c9
1530ad2d06b7
hex1b4901238d

117188928397 has 2 divisors, whose sum is σ = 117188928398. Its totient is φ = 117188928396.

The previous prime is 117188928379. The next prime is 117188928401. The reversal of 117188928397 is 793829881711.

Together with previous prime (117188928379) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 82087407081 + 35101521316 = 286509^2 + 187354^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 117188928397 - 235 = 82829190029 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2117188928397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 12192768, while the sum is 64.

The spelling of 117188928397 in words is "one hundred seventeen billion, one hundred eighty-eight million, nine hundred twenty-eight thousand, three hundred ninety-seven".