Search a number
-
+
112434255004249 is a prime number
BaseRepresentation
bin11001100100001000100011…
…110101001000001001011001
3112202002121110112210111222001
4121210020203311020021121
5104214110323240113444
61035043330024401001
732453051436614653
oct3144104365101131
9482077415714861
10112434255004249
1132909110882042
121073a618616161
134a97673c32a39
141da9bc01716d3
15ceea165598d4
hex664223d48259

112434255004249 has 2 divisors, whose sum is σ = 112434255004250. Its totient is φ = 112434255004248.

The previous prime is 112434255004189. The next prime is 112434255004259. The reversal of 112434255004249 is 942400552434211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 64750990240000 + 47683264764249 = 8046800^2 + 6905307^2 .

It is a cyclic number.

It is not a de Polignac number, because 112434255004249 - 227 = 112434120786521 is a prime.

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

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

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

Almost surely, 2112434255004249 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1382400, while the sum is 46.

The spelling of 112434255004249 in words is "one hundred twelve trillion, four hundred thirty-four billion, two hundred fifty-five million, four thousand, two hundred forty-nine".