Search a number
-
+
14540301111467 is a prime number
BaseRepresentation
bin1101001110010110110101…
…1110111001000010101011
31220111001001120210020210002
43103211231132321002223
53401212014041031332
650531415551013215
73030334134126635
oct323455536710253
956431046706702
1014540301111467
1146a6563a0467a
12176a01150a20b
138161b5650c31
14383a7bc41a55
151a335eb96562
hexd396d7b90ab

14540301111467 has 2 divisors, whose sum is σ = 14540301111468. Its totient is φ = 14540301111466.

The previous prime is 14540301111373. The next prime is 14540301111487. The reversal of 14540301111467 is 76411110304541.

It is a strong prime.

It is an emirp because it is prime and its reverse (76411110304541) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 14540301111467 - 222 = 14540296917163 is a prime.

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

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

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

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

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

Almost surely, 214540301111467 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 40320, while the sum is 38.

The spelling of 14540301111467 in words is "fourteen trillion, five hundred forty billion, three hundred one million, one hundred eleven thousand, four hundred sixty-seven".