Search a number
-
+
105605011097 is a prime number
BaseRepresentation
bin110001001011010001…
…1001001011010011001
3101002120210110102000022
41202112203021122121
53212234340323342
6120303025520225
710425663532505
oct1422643113231
9332523412008
10105605011097
1140872303983
1218572aa3075
139c5cacca61
14517b611305
152b3134d9d2
hex18968c9699

105605011097 has 2 divisors, whose sum is σ = 105605011098. Its totient is φ = 105605011096.

The previous prime is 105605010983. The next prime is 105605011121. The reversal of 105605011097 is 790110506501.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 85655143561 + 19949867536 = 292669^2 + 141244^2 .

It is a cyclic number.

It is not a de Polignac number, because 105605011097 - 216 = 105604945561 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2105605011097 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9450, while the sum is 35.

Adding to 105605011097 its reverse (790110506501), we get a palindrome (895715517598).

The spelling of 105605011097 in words is "one hundred five billion, six hundred five million, eleven thousand, ninety-seven".