Search a number
-
+
1031122114109 is a prime number
BaseRepresentation
bin11110000000100111010…
…10101101011000111101
310122120111200011122000222
433000103222231120331
5113343214230122414
62105405125231125
7134332111233413
oct17002352553075
93576450148028
101031122114109
1136832960895a
12147a088624a5
1376307c85089
1437c999092b3
151bc4db4368e
hexf013aad63d

1031122114109 has 2 divisors, whose sum is σ = 1031122114110. Its totient is φ = 1031122114108.

The previous prime is 1031122114019. The next prime is 1031122114117. The reversal of 1031122114109 is 9014112211301.

Together with previous prime (1031122114019) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 734508991225 + 296613122884 = 857035^2 + 544622^2 .

It is a cyclic number.

It is not a de Polignac number, because 1031122114109 - 216 = 1031122048573 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21031122114109 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 432, while the sum is 26.

The spelling of 1031122114109 in words is "one trillion, thirty-one billion, one hundred twenty-two million, one hundred fourteen thousand, one hundred nine".