Search a number
-
+
110560345197221 is a prime number
BaseRepresentation
bin11001001000110111010110…
…000110100000101010100101
3112111110110120112220010200002
4121020313112012200222211
5103442410041332302341
61031050415454031045
732200502264225633
oct3110672606405245
9474413515803602
10110560345197221
113225641961a507
1210497403aa8485
13498ca4654050a
141d432137d4353
15cbaddd03429b
hex648dd61a0aa5

110560345197221 has 2 divisors, whose sum is σ = 110560345197222. Its totient is φ = 110560345197220.

The previous prime is 110560345197163. The next prime is 110560345197227. The reversal of 110560345197221 is 122791543065011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 94699951332100 + 15860393865121 = 9731390^2 + 3982511^2 .

It is a cyclic number.

It is not a de Polignac number, because 110560345197221 - 226 = 110560278088357 is a prime.

It is a super-2 number, since 2×1105603451972212 (a number of 29 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 2110560345197221 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 110560345197221 in words is "one hundred ten trillion, five hundred sixty billion, three hundred forty-five million, one hundred ninety-seven thousand, two hundred twenty-one".