Search a number
-
+
111121014397 is a prime number
BaseRepresentation
bin110011101111101010…
…1000001111001111101
3101121211012210102000211
41213133111001321331
53310033434430042
6123014232552421
711012453016001
oct1473725017175
9347735712024
10111121014397
1143142a08898
1219652252711
13a62b827933
145542032701
152d55730017
hex19df541e7d

111121014397 has 2 divisors, whose sum is σ = 111121014398. Its totient is φ = 111121014396.

The previous prime is 111121014331. The next prime is 111121014413. The reversal of 111121014397 is 793410121111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 109477603876 + 1643410521 = 330874^2 + 40539^2 .

It is a cyclic number.

It is not a de Polignac number, because 111121014397 - 27 = 111121014269 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2111121014397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 31.

The spelling of 111121014397 in words is "one hundred eleven billion, one hundred twenty-one million, fourteen thousand, three hundred ninety-seven".