Search a number
-
+
14111215607 is a prime number
BaseRepresentation
bin11010010010001100…
…00000111111110111
31100102102202000201002
431021012000333313
5212344432344412
610252124153515
71006455232166
oct151106007767
940372660632
1014111215607
115a91460165
12289999889b
13143b67b628
1497c1873dd
15578ca0dc2
hex349180ff7

14111215607 has 2 divisors, whose sum is σ = 14111215608. Its totient is φ = 14111215606.

The previous prime is 14111215571. The next prime is 14111215627. The reversal of 14111215607 is 70651211141.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 14111215607 - 228 = 13842780151 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (14111215627) by changing a digit.

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

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

Almost surely, 214111215607 is an apocalyptic number.

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

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

14111215607 is an evil number, because the sum of its binary digits is even.

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

Adding to 14111215607 its reverse (70651211141), we get a palindrome (84762426748).

The spelling of 14111215607 in words is "fourteen billion, one hundred eleven million, two hundred fifteen thousand, six hundred seven".