Search a number
-
+
14506561463609 is a prime number
BaseRepresentation
bin1101001100011001001001…
…1100010110010100111001
31220100210222012200112221202
43103012102130112110321
53400133414213313414
650504120005143545
73025031054633435
oct323062234262471
956323865615852
1014506561463609
11469321a840886
1217635760babb5
13812c69592a67
1438219ac959c5
151a2537ac39de
hexd3192716539

14506561463609 has 2 divisors, whose sum is σ = 14506561463610. Its totient is φ = 14506561463608.

The previous prime is 14506561463593. The next prime is 14506561463663. The reversal of 14506561463609 is 90636416560541.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7768010023225 + 6738551440384 = 2787115^2 + 2595872^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 14506561463609 - 24 = 14506561463593 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 214506561463609 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13996800, while the sum is 56.

The spelling of 14506561463609 in words is "fourteen trillion, five hundred six billion, five hundred sixty-one million, four hundred sixty-three thousand, six hundred nine".