Search a number
-
+
14327890657 is a prime number
BaseRepresentation
bin11010101100000001…
…00100001011100001
31100222112110020222221
431112000210023201
5213320420000112
610325424231041
71015026026653
oct152600441341
940875406887
1014327890657
1160927a2353
12293a46b481
131474523812
1499cc6a6d3
1558cd00e07
hex3560242e1

14327890657 has 2 divisors, whose sum is σ = 14327890658. Its totient is φ = 14327890656.

The previous prime is 14327890609. The next prime is 14327890663. The reversal of 14327890657 is 75609872341.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14028981136 + 298909521 = 118444^2 + 17289^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-14327890657 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅14327890657 = 28655781314 is not.

Almost surely, 214327890657 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2540160, while the sum is 52.

The spelling of 14327890657 in words is "fourteen billion, three hundred twenty-seven million, eight hundred ninety thousand, six hundred fifty-seven".