Search a number
-
+
112370282261 is a prime number
BaseRepresentation
bin110100010100111001…
…0100110111100010101
3101202001021111210100222
41220221302212330111
53320113243013021
6123342221044125
711055432432236
oct1505162467425
9352037453328
10112370282261
1143724105276
12199406b6645
13a79a5ac1a3
14561dd0908d
152dca24d6ab
hex1a29ca6f15

112370282261 has 2 divisors, whose sum is σ = 112370282262. Its totient is φ = 112370282260.

The previous prime is 112370282237. The next prime is 112370282263. The reversal of 112370282261 is 162282073211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102724096036 + 9646186225 = 320506^2 + 98215^2 .

It is a cyclic number.

It is not a de Polignac number, because 112370282261 - 210 = 112370281237 is a prime.

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

Together with 112370282263, 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 (112370282263) by changing a digit.

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

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

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

Almost surely, 2112370282261 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 112370282261 in words is "one hundred twelve billion, three hundred seventy million, two hundred eighty-two thousand, two hundred sixty-one".