Search a number
-
+
105671513 is a prime number
BaseRepresentation
bin1100100110001…
…10101101011001
321100211200001202
412103012231121
5204022442023
614252523545
72422123133
oct623065531
9240750052
10105671513
1154715632
122b4805b5
1318b7b12c
141006a053
159425128
hex64c6b59

105671513 has 2 divisors, whose sum is σ = 105671514. Its totient is φ = 105671512.

The previous prime is 105671497. The next prime is 105671623. The reversal of 105671513 is 315176501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 84400969 + 21270544 = 9187^2 + 4612^2 .

It is a cyclic number.

It is not a de Polignac number, because 105671513 - 24 = 105671497 is a prime.

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

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

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

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

Almost surely, 2105671513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3150, while the sum is 29.

The square root of 105671513 is about 10279.6650237252. The cubic root of 105671513 is about 472.7729736647.

The spelling of 105671513 in words is "one hundred five million, six hundred seventy-one thousand, five hundred thirteen".