Search a number
-
+
106614731 is a prime number
BaseRepresentation
bin1100101101011…
…00111111001011
321102121120220202
412112230333023
5204243132411
614325042415
72433132056
oct626547713
9242546822
10106614731
11551aa253
122b85640b
131911b552
1410233a9d
15955e83b
hex65acfcb

106614731 has 2 divisors, whose sum is σ = 106614732. Its totient is φ = 106614730.

The previous prime is 106614721. The next prime is 106614773. The reversal of 106614731 is 137416601.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 106614731 - 210 = 106613707 is a prime.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 106614694 and 106614703.

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

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

Almost surely, 2106614731 is an apocalyptic number.

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

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

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

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

The square root of 106614731 is about 10325.4409591068. The cubic root of 106614731 is about 474.1754574259.

The spelling of 106614731 in words is "one hundred six million, six hundred fourteen thousand, seven hundred thirty-one".