Search a number
-
+
14013151211 is a prime number
BaseRepresentation
bin11010000110011111…
…11011011111101011
31100011121012211122102
431003033323133223
5212144331314321
610234302244015
71004154551153
oct150317733753
940147184572
1014013151211
115a41070a04
122870b8660b
131424264b67
1496d13b763
1557037ec0b
hex3433fb7eb

14013151211 has 2 divisors, whose sum is σ = 14013151212. Its totient is φ = 14013151210.

The previous prime is 14013151121. The next prime is 14013151213. The reversal of 14013151211 is 11215131041.

Together with previous prime (14013151121) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 14013151211 - 214 = 14013134827 is a prime.

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

It is a Chen prime.

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

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

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

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

Almost surely, 214013151211 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 120, while the sum is 20.

Adding to 14013151211 its reverse (11215131041), we get a palindrome (25228282252).

The spelling of 14013151211 in words is "fourteen billion, thirteen million, one hundred fifty-one thousand, two hundred eleven".