[go: up one dir, main page]

Search a number
-
+
13370111 is a prime number
BaseRepresentation
bin110011000000…
…001011111111
3221011021100022
4303000023333
511410320421
61154322355
7221433626
oct63001377
927137308
1013370111
117602187
1245893bb
132a01811
141ac06bd
1512917ab
hexcc02ff

13370111 has 2 divisors, whose sum is σ = 13370112. Its totient is φ = 13370110.

The previous prime is 13370089. The next prime is 13370113. The reversal of 13370111 is 11107331.

13370111 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

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

It is a Sophie Germain prime.

Together with 13370113, 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 13370111.

It is a congruent number.

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

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

Almost surely, 213370111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 63, while the sum is 17.

The square root of 13370111 is about 3656.5162381699. The cubic root of 13370111 is about 237.3440438731.

Adding to 13370111 its reverse (11107331), we get a palindrome (24477442).

The spelling of 13370111 in words is "thirteen million, three hundred seventy thousand, one hundred eleven".