Search a number
-
+
105536957 is a prime number
BaseRepresentation
bin1100100101001…
…01110110111101
321100120211111012
412102211312331
5204004140312
614250005005
72421022631
oct622456675
9240524435
10105536957
1154633529
122b416765
1318b31b06
1410032dc1
1593ea322
hex64a5dbd

105536957 has 2 divisors, whose sum is σ = 105536958. Its totient is φ = 105536956.

The previous prime is 105536947. The next prime is 105536999. The reversal of 105536957 is 759635501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 56942116 + 48594841 = 7546^2 + 6971^2 .

It is a cyclic number.

It is not a de Polignac number, because 105536957 - 24 = 105536941 is a prime.

It is a super-2 number, since 2×1055369572 = 22276098585639698, 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 (105536947) by changing a digit.

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

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

Almost surely, 2105536957 is an apocalyptic number.

It is an amenable number.

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

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

105536957 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 141750, while the sum is 41.

The square root of 105536957 is about 10273.1181731741. The cubic root of 105536957 is about 472.5722211675.

The spelling of 105536957 in words is "one hundred five million, five hundred thirty-six thousand, nine hundred fifty-seven".