Search a number
-
+
4159609251113 is a prime number
BaseRepresentation
bin111100100001111100000…
…010000010010100101001
3112201122200022122202020002
4330201330002002110221
51021122334432013423
612502521554112345
7606343665154541
oct74417402022451
915648608582202
104159609251113
111364097a88368
125721b087b6b5
132423321127a4
1410547cdba321
15733034b0228
hex3c87c082529

4159609251113 has 2 divisors, whose sum is σ = 4159609251114. Its totient is φ = 4159609251112.

The previous prime is 4159609251071. The next prime is 4159609251131. The reversal of 4159609251113 is 3111529069514.

Together with next prime (4159609251131) 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., 3439125742144 + 720483508969 = 1854488^2 + 848813^2 .

It is a cyclic number.

It is not a de Polignac number, because 4159609251113 - 210 = 4159609250089 is a prime.

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

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

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

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

Almost surely, 24159609251113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 291600, while the sum is 47.

The spelling of 4159609251113 in words is "four trillion, one hundred fifty-nine billion, six hundred nine million, two hundred fifty-one thousand, one hundred thirteen".