Search a number
-
+
111210199097 is a prime number
BaseRepresentation
bin110011110010010100…
…1001111100000111001
3101122001102121110102212
41213210221033200321
53310224302332342
6123031140304505
711014615044464
oct1474451174071
9348042543385
10111210199097
1143189292658
12196780a2135
13a64415274a
14554dc0a2db
152d5d49a182
hex19e4a4f839

111210199097 has 2 divisors, whose sum is σ = 111210199098. Its totient is φ = 111210199096.

The previous prime is 111210199091. The next prime is 111210199099. The reversal of 111210199097 is 790991012111.

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., 109961212816 + 1248986281 = 331604^2 + 35341^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 111210199097 - 26 = 111210199033 is a prime.

Together with 111210199099, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 2111210199097 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10206, while the sum is 41.

The spelling of 111210199097 in words is "one hundred eleven billion, two hundred ten million, one hundred ninety-nine thousand, ninety-seven".