Search a number
-
+
10112311117 is a prime number
BaseRepresentation
bin10010110101011110…
…11001111101001101
3222002202002122000101
421122233121331031
5131202222423432
64351233531101
7505410140416
oct113257317515
928082078011
1010112311117
11431a155017
121b62713a91
13c5205175c
146bd03a80d
153e2b954e7
hex25abd9f4d

10112311117 has 2 divisors, whose sum is σ = 10112311118. Its totient is φ = 10112311116.

The previous prime is 10112311109. The next prime is 10112311171. The reversal of 10112311117 is 71111321101.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8974530756 + 1137780361 = 94734^2 + 33731^2 .

It is a cyclic number.

It is not a de Polignac number, because 10112311117 - 23 = 10112311109 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 10112311094 and 10112311103.

It is a congruent number.

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

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

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

Almost surely, 210112311117 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 42, while the sum is 19.

Adding to 10112311117 its reverse (71111321101), we get a palindrome (81223632218).

The spelling of 10112311117 in words is "ten billion, one hundred twelve million, three hundred eleven thousand, one hundred seventeen".