Search a number
-
+
105722793701297 is a prime number
BaseRepresentation
bin11000000010011110000001…
…100100000010111110110001
3111212100000000021022001101222
4120002132001210002332301
5102324130240141420142
61012504214140434425
731161135246040523
oct3002360144027661
9455300007261358
10105722793701297
113076086a9474a3
12ba35951848a15
1346cb802a85056
141c17020c09a13
15c3515c207bd2
hex602781902fb1

105722793701297 has 2 divisors, whose sum is σ = 105722793701298. Its totient is φ = 105722793701296.

The previous prime is 105722793701263. The next prime is 105722793701339. The reversal of 105722793701297 is 792107397227501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 105722793701281 + 16 = 10282159^2 + 4^2 .

It is a cyclic number.

It is not a de Polignac number, because 105722793701297 - 214 = 105722793684913 is a prime.

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

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

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

Almost surely, 2105722793701297 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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