Search a number
-
+
110111213199997 is a prime number
BaseRepresentation
bin11001000010010101000011…
…101111111010001001111101
3112102212112021202210201000101
4121002111003233322021331
5103413030231034344442
61030104220520401101
732123162340233332
oct3102250357721175
9472775252721011
10110111213199997
11320a29a3292429
121042435a616191
13495959ac34a89
141d295a82cc989
15cae3a30a1cb7
hex642543bfa27d

110111213199997 has 2 divisors, whose sum is σ = 110111213199998. Its totient is φ = 110111213199996.

The previous prime is 110111213199941. The next prime is 110111213200111. The reversal of 110111213199997 is 799991312111011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 84606349745241 + 25504863454756 = 9198171^2 + 5050234^2 .

It is a cyclic number.

It is not a de Polignac number, because 110111213199997 - 215 = 110111213167229 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2110111213199997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 275562, while the sum is 55.

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