Search a number
-
+
13112031103991 is a prime number
BaseRepresentation
bin1011111011001110000111…
…1101001100101111110111
31201102111102222210021112022
42332303201331030233313
53204311414430311431
643515330043543355
72522212232311001
oct276634175145767
951374388707468
1013112031103991
1141a5865801346
12157924882ab5b
137415c7bcccb1
143348a8c7d371
1517b119c3807b
hexbece1f4cbf7

13112031103991 has 2 divisors, whose sum is σ = 13112031103992. Its totient is φ = 13112031103990.

The previous prime is 13112031103979. The next prime is 13112031103993. The reversal of 13112031103991 is 19930113021131.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 13112031103991 - 214 = 13112031087607 is a prime.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (13112031103993) 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, 6556015551995 + 6556015551996.

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

Almost surely, 213112031103991 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4374, while the sum is 35.

The spelling of 13112031103991 in words is "thirteen trillion, one hundred twelve billion, thirty-one million, one hundred three thousand, nine hundred ninety-one".