Search a number
-
+
110956344801713 is a prime number
BaseRepresentation
bin11001001110101000001001…
…100001000111100110110001
3112112212022201110000100200022
4121032220021201013212301
5104020402043232123323
61031552350251533225
732241221442305165
oct3116501141074661
9475768643010608
10110956344801713
113239935a018514
12105400bb45a215
1349bb1a514c108
141d5845c57cca5
15cc636862a4c8
hex64ea098479b1

110956344801713 has 2 divisors, whose sum is σ = 110956344801714. Its totient is φ = 110956344801712.

The previous prime is 110956344801667. The next prime is 110956344801719. The reversal of 110956344801713 is 317108443659011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 82219701330064 + 28736643471649 = 9067508^2 + 5360657^2 .

It is a cyclic number.

It is not a de Polignac number, because 110956344801713 - 26 = 110956344801649 is a prime.

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

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

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

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

Almost surely, 2110956344801713 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 110956344801713 in words is "one hundred ten trillion, nine hundred fifty-six billion, three hundred forty-four million, eight hundred one thousand, seven hundred thirteen".