Search a number
-
+
110972681146529 is a prime number
BaseRepresentation
bin11001001110110111010111…
…001111010101000010100001
3112112220212212221201122211022
4121032313113033111002201
5104021134022333142104
61032004051304255225
732242340330040506
oct3116672717250241
9475825787648738
10110972681146529
11323a5282501134
12105432ba471515
1349bc8a97ba037
141d5916c0654ad
15cc69c290dbbe
hex64edd73d50a1

110972681146529 has 2 divisors, whose sum is σ = 110972681146530. Its totient is φ = 110972681146528.

The previous prime is 110972681146517. The next prime is 110972681146553. The reversal of 110972681146529 is 925641186279011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 87531367872400 + 23441313274129 = 9355820^2 + 4841623^2 .

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

It is a cyclic number.

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

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

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

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

Almost surely, 2110972681146529 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13063680, while the sum is 62.

The spelling of 110972681146529 in words is "one hundred ten trillion, nine hundred seventy-two billion, six hundred eighty-one million, one hundred forty-six thousand, five hundred twenty-nine".