Search a number
-
+
111493714681 is a prime number
BaseRepresentation
bin110011111010110001…
…0110001001011111001
3101122210012002112201001
41213311202301023321
53311314342332211
6123115225125001
711024626636516
oct1476542611371
9348705075631
10111493714681
1143314328058
1219737029761
13a68aacb34b
14557972c30d
152d782eeac1
hex19f58b12f9

111493714681 has 2 divisors, whose sum is σ = 111493714682. Its totient is φ = 111493714680.

The previous prime is 111493714603. The next prime is 111493714697. The reversal of 111493714681 is 186417394111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 87226306281 + 24267408400 = 295341^2 + 155780^2 .

It is a cyclic number.

It is not a de Polignac number, because 111493714681 - 217 = 111493583609 is a prime.

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

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

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

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

Almost surely, 2111493714681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 145152, while the sum is 46.

The spelling of 111493714681 in words is "one hundred eleven billion, four hundred ninety-three million, seven hundred fourteen thousand, six hundred eighty-one".