Search a number
-
+
106958567 is a prime number
BaseRepresentation
bin1100110000000…
…00111011100111
321110021001120102
412120000323213
5204340133232
614340254315
72436063362
oct630007347
9243231512
10106958567
1155414611
122b9a139b
131920bbc1
14102c30d9
1595cb662
hex6600ee7

106958567 has 2 divisors, whose sum is σ = 106958568. Its totient is φ = 106958566.

The previous prime is 106958521. The next prime is 106958569. The reversal of 106958567 is 765859601.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-106958567 is a prime.

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

Together with 106958569, 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 (106958569) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2106958567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 453600, while the sum is 47.

The square root of 106958567 is about 10342.0774992262. The cubic root of 106958567 is about 474.6846542200.

The spelling of 106958567 in words is "one hundred six million, nine hundred fifty-eight thousand, five hundred sixty-seven".