Search a number
-
+
112565372713 is a prime number
BaseRepresentation
bin110100011010101101…
…0110100011100101001
3101202112212121102011021
41220311122310130221
53321013213411323
6123413430332441
711063321611123
oct1506532643451
9352485542137
10112565372713
1143814244652
1219995aba121
13a7cbb37921
14563bbb0213
152ddc43805d
hex1a356b4729

112565372713 has 2 divisors, whose sum is σ = 112565372714. Its totient is φ = 112565372712.

The previous prime is 112565372629. The next prime is 112565372723. The reversal of 112565372713 is 317273565211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 73942117929 + 38623254784 = 271923^2 + 196528^2 .

It is an emirp because it is prime and its reverse (317273565211) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 112565372713 - 225 = 112531818281 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 112565372713.

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

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

Almost surely, 2112565372713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 264600, while the sum is 43.

The spelling of 112565372713 in words is "one hundred twelve billion, five hundred sixty-five million, three hundred seventy-two thousand, seven hundred thirteen".