Search a number
-
+
13111113022193 is a prime number
BaseRepresentation
bin1011111011001010101100…
…1110111111101011110001
31201102102002000020220001202
42332302223032333223301
53204303024413202233
643515055010140545
72522150413612454
oct276625316775361
951372060226052
1013111113022193
1141a543454995a
121579031281755
137414ac945324
1433481cd7749b
1517b0b4338be8
hexbecab3bfaf1

13111113022193 has 2 divisors, whose sum is σ = 13111113022194. Its totient is φ = 13111113022192.

The previous prime is 13111113022169. The next prime is 13111113022201. The reversal of 13111113022193 is 39122031111131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12899791690384 + 211321331809 = 3591628^2 + 459697^2 .

It is a cyclic number.

It is not a de Polignac number, because 13111113022193 - 26 = 13111113022129 is a prime.

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

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

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

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

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

Almost surely, 213111113022193 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 29.

The spelling of 13111113022193 in words is "thirteen trillion, one hundred eleven billion, one hundred thirteen million, twenty-two thousand, one hundred ninety-three".