Search a number
-
+
13372607 is a prime number
BaseRepresentation
bin110011000000…
…110010111111
3221011101202202
4303000302333
511410410412
61154342115
7221444123
oct63006277
927141682
1013372607
117604046
12458a93b
132a029b1
141ac1583
1512923c2
hexcc0cbf

13372607 has 2 divisors, whose sum is σ = 13372608. Its totient is φ = 13372606.

The previous prime is 13372573. The next prime is 13372609. The reversal of 13372607 is 70627331.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 13372607 - 26 = 13372543 is a prime.

Together with 13372609, it forms a pair of twin primes.

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 13372607.

It is a congruent number.

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

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

Almost surely, 213372607 is an apocalyptic number.

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

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

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

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

The square root of 13372607 is about 3656.8575307222. The cubic root of 13372607 is about 237.3588124833.

Adding to 13372607 its reverse (70627331), we get a palindrome (83999938).

The spelling of 13372607 in words is "thirteen million, three hundred seventy-two thousand, six hundred seven".