Search a number
-
+
105625909 is a prime number
BaseRepresentation
bin1100100101110…
…11100100110101
321100202100111201
412102323210311
5204020012114
614251532501
72421543154
oct622734465
9240670451
10105625909
1154694344
122b45a131
1318b6344c
141005759b
159416874
hex64bb935

105625909 has 2 divisors, whose sum is σ = 105625910. Its totient is φ = 105625908.

The previous prime is 105625907. The next prime is 105625943. The reversal of 105625909 is 909526501.

105625909 = T8390 + T8391 + T8392.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 56205009 + 49420900 = 7497^2 + 7030^2 .

It is a cyclic number.

It is not a de Polignac number, because 105625909 - 21 = 105625907 is a prime.

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

Together with 105625907, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2105625909 is an apocalyptic number.

105625909 is the 8392-nd centered triangular number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24300, while the sum is 37.

The square root of 105625909 is about 10277.4466186889. The cubic root of 105625909 is about 472.7049533113.

It can be divided in two parts, 10562 and 5909, that added together give a triangular number (16471 = T181).

The spelling of 105625909 in words is "one hundred five million, six hundred twenty-five thousand, nine hundred nine".