Search a number
-
+
105602261 is a prime number
BaseRepresentation
bin1100100101101…
…01110011010101
321100201011001212
412102311303111
5204013233021
614251231205
72421414212
oct622656325
9240634055
10105602261
11546785a6
122b448505
1318b5575b
141004cb09
15940e85b
hex64b5cd5

105602261 has 2 divisors, whose sum is σ = 105602262. Its totient is φ = 105602260.

The previous prime is 105602221. The next prime is 105602293. The reversal of 105602261 is 162206501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 99002500 + 6599761 = 9950^2 + 2569^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 105602261 - 26 = 105602197 is a prime.

It is a super-2 number, since 2×1056022612 = 22303675056624242, which contains 22 as substring.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2105602261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 720, while the sum is 23.

The square root of 105602261 is about 10276.2960739753. The cubic root of 105602261 is about 472.6696735799.

Adding to 105602261 its reverse (162206501), we get a palindrome (267808762).

It can be divided in two parts, 10560 and 2261, that added together give a palindrome (12821).

The spelling of 105602261 in words is "one hundred five million, six hundred two thousand, two hundred sixty-one".