Search a number
-
+
14501406454393 is a prime number
BaseRepresentation
bin1101001100000101111100…
…1011100011001001111001
31220100022122221121221201111
43103001133023203021321
53400042340023020033
650501504255320321
73024456241034155
oct323013713431171
956308587557644
1014501406454393
114691014990091
1217625778200a1
138126275a0251
14381c2c3a4065
151a233524d7cd
hexd305f2e3279

14501406454393 has 2 divisors, whose sum is σ = 14501406454394. Its totient is φ = 14501406454392.

The previous prime is 14501406454291. The next prime is 14501406454439. The reversal of 14501406454393 is 39345460410541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10632738380944 + 3868668073449 = 3260788^2 + 1966893^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 14501406454393 - 217 = 14501406323321 is a prime.

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

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

Almost surely, 214501406454393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3110400, while the sum is 49.

The spelling of 14501406454393 in words is "fourteen trillion, five hundred one billion, four hundred six million, four hundred fifty-four thousand, three hundred ninety-three".