Search a number
-
+
106904971 is a prime number
BaseRepresentation
bin1100101111100…
…11110110001011
321110011100001101
412113303312023
5204331424341
614335202231
72435451205
oct627636613
9243140041
10106904971
1155388318
122b976377
13191c06a4
14102ab775
1595ba831
hex65f3d8b

106904971 has 2 divisors, whose sum is σ = 106904972. Its totient is φ = 106904970.

The previous prime is 106904953. The next prime is 106904983. The reversal of 106904971 is 179409601.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 106904971 - 215 = 106872203 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 106904971.

It is not a weakly prime, because it can be changed into another prime (106904921) 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, 53452485 + 53452486.

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

Almost surely, 2106904971 is an apocalyptic number.

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

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

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

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

The square root of 106904971 is about 10339.4860123702. The cubic root of 106904971 is about 474.6053542004.

The spelling of 106904971 in words is "one hundred six million, nine hundred four thousand, nine hundred seventy-one".