Search a number
-
+
110641198406561 is a prime number
BaseRepresentation
bin11001001010000010101001…
…010101000001101110100001
3112111202012021100110201211222
4121022002221111001232201
5104000221133243002221
61031151510450544425
732206364016166214
oct3112025125015641
9474665240421758
10110641198406561
113228773a0aa379
12104ab009598115
134997560368314
141d470c39c977b
15cbd07138a9ab
hex64a0a9541ba1

110641198406561 has 2 divisors, whose sum is σ = 110641198406562. Its totient is φ = 110641198406560.

The previous prime is 110641198406461. The next prime is 110641198406639. The reversal of 110641198406561 is 165604891146011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 110622412962961 + 18785443600 = 10517719^2 + 137060^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-110641198406561 is a prime.

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

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

Almost surely, 2110641198406561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1244160, while the sum is 53.

The spelling of 110641198406561 in words is "one hundred ten trillion, six hundred forty-one billion, one hundred ninety-eight million, four hundred six thousand, five hundred sixty-one".