Search a number
-
+
10294885056739 is a prime number
BaseRepresentation
bin1001010111001111011011…
…1101111000000011100011
31100110011220020111020111111
42111303312331320003203
52322132411033303424
633521223243124151
72111531564101633
oct225636675700343
940404806436444
1010294885056739
11330a044255788
1211a3274213657
13598a5a38218a
142783bcc0c6c3
1512cbd8543194
hex95cf6f780e3

10294885056739 has 2 divisors, whose sum is σ = 10294885056740. Its totient is φ = 10294885056738.

The previous prime is 10294885056713. The next prime is 10294885056791. The reversal of 10294885056739 is 93765058849201.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 10294885056739 - 27 = 10294885056611 is a prime.

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅10294885056739 = 20589770113478 is not.

Almost surely, 210294885056739 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 130636800, while the sum is 67.

The spelling of 10294885056739 in words is "ten trillion, two hundred ninety-four billion, eight hundred eighty-five million, fifty-six thousand, seven hundred thirty-nine".