Search a number
-
+
106937513 is a prime number
BaseRepresentation
bin1100101111110…
…11110010101001
321110012222200122
412113323302221
5204334000023
614340013025
72435645114
oct627736251
9243188618
10106937513
11553aa811
122b991175
1319202447
14102b957b
1595c52c8
hex65fbca9

106937513 has 2 divisors, whose sum is σ = 106937514. Its totient is φ = 106937512.

The previous prime is 106937489. The next prime is 106937521. The reversal of 106937513 is 315739601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 80856064 + 26081449 = 8992^2 + 5107^2 .

It is a cyclic number.

It is not a de Polignac number, because 106937513 - 216 = 106871977 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 2106937513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17010, while the sum is 35.

The square root of 106937513 is about 10341.0595685355. The cubic root of 106937513 is about 474.6535061259.

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