Search a number
-
+
106445567 is a prime number
BaseRepresentation
bin1100101100000…
…11101011111111
321102021222212102
412112003223333
5204222224232
614321255315
72431525634
oct626035377
9242258772
10106445567
11550a4148
122b79453b
131908c557
14101cc18b
159529662
hex6583aff

106445567 has 2 divisors, whose sum is σ = 106445568. Its totient is φ = 106445566.

The previous prime is 106445539. The next prime is 106445579. The reversal of 106445567 is 765544601.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 106445567 - 26 = 106445503 is a prime.

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

It is a Chen prime.

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

It is a congruent number.

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

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

Almost surely, 2106445567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 100800, while the sum is 38.

The square root of 106445567 is about 10317.2460957370. The cubic root of 106445567 is about 473.9245356310.

The spelling of 106445567 in words is "one hundred six million, four hundred forty-five thousand, five hundred sixty-seven".