Search a number
-
+
1312111112141 is a prime number
BaseRepresentation
bin10011000101111111111…
…010101010111111001101
311122102210021112200210002
4103011333322222333031
5132444200421042031
62442435302454045
7163540223301254
oct23057772527715
94572707480702
101312111112141
11466510574a85
12192367434325
139696829359b
1447713c4b79b
15241e72e2ccb
hex1317feaafcd

1312111112141 has 2 divisors, whose sum is σ = 1312111112142. Its totient is φ = 1312111112140.

The previous prime is 1312111112131. The next prime is 1312111112189. The reversal of 1312111112141 is 1412111112131.

It is a m-pointer prime, because the next prime (1312111112189) can be obtained adding 1312111112141 to its product of digits (48).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 737114970916 + 574996141225 = 858554^2 + 758285^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1312111112141 is a prime.

It is a congruent number.

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

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

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

Almost surely, 21312111112141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 48, while the sum is 20.

Adding to 1312111112141 its reverse (1412111112131), we get a palindrome (2724222224272).

The spelling of 1312111112141 in words is "one trillion, three hundred twelve billion, one hundred eleven million, one hundred twelve thousand, one hundred forty-one".