Search a number
-
+
14510301551 is a prime number
BaseRepresentation
bin11011000001110000…
…11010000101101111
31101110020200200200222
431200320122011233
5214204114122201
610355502041555
71022402346104
oct154070320557
941406620628
1014510301551
116176761359
12298b5792bb
1314a325cb65
149b9190aab
1559dd3391b
hex360e1a16f

14510301551 has 2 divisors, whose sum is σ = 14510301552. Its totient is φ = 14510301550.

The previous prime is 14510301527. The next prime is 14510301563. The reversal of 14510301551 is 15510301541.

14510301551 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 a de Polignac number, because none of the positive numbers 2k-14510301551 is a prime.

It is a super-2 number, since 2×145103015512 (a number of 21 digits) contains 22 as substring.

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

Almost surely, 214510301551 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1500, while the sum is 26.

The spelling of 14510301551 in words is "fourteen billion, five hundred ten million, three hundred one thousand, five hundred fifty-one".