Search a number
-
+
14506161751 is a prime number
BaseRepresentation
bin11011000001010001…
…00111011001010111
31101102221220100222001
431200220213121113
5214202034134001
610355233220131
71022322224524
oct154050473127
941387810861
1014506161751
116174394034
12298a101647
1314a2440783
149b87d414b
1559d7b7001
hex360a27657

14506161751 has 2 divisors, whose sum is σ = 14506161752. Its totient is φ = 14506161750.

The previous prime is 14506161701. The next prime is 14506161763. The reversal of 14506161751 is 15716160541.

14506161751 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 14506161751 - 231 = 12358678103 is a prime.

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

It is a congruent number.

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

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

Almost surely, 214506161751 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 37.

The spelling of 14506161751 in words is "fourteen billion, five hundred six million, one hundred sixty-one thousand, seven hundred fifty-one".