Search a number
-
+
14333053151 is a prime number
BaseRepresentation
bin11010101100101000…
…10000100011011111
31100222220011112121102
431112110100203133
5213323230200101
610330131023315
71015120640654
oct152624204337
940886145542
1014333053151
1160956a8a7a
12294013ab3b
131475610551
1499d811c2b
1558d4c086b
hex3565108df

14333053151 has 2 divisors, whose sum is σ = 14333053152. Its totient is φ = 14333053150.

The previous prime is 14333053109. The next prime is 14333053153. The reversal of 14333053151 is 15135033341.

14333053151 is digitally balanced in base 2, 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 not a de Polignac number, because 14333053151 - 26 = 14333053087 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 214333053151 is an apocalyptic number.

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

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

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

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

Adding to 14333053151 its reverse (15135033341), we get a palindrome (29468086492).

The spelling of 14333053151 in words is "fourteen billion, three hundred thirty-three million, fifty-three thousand, one hundred fifty-one".