Search a number
-
+
14562315243551 is a prime number
BaseRepresentation
bin1101001111101000110110…
…1000001001000000011111
31220120010212210021000211102
43103322031220021000133
53402042110200243201
650545500230143315
73032043514145015
oct323721550110037
956503783230742
1014562315243551
114704930352969
121772335ab1b3b
138182b33b04aa
14384b698208b5
151a3bec66726b
hexd3e8da0901f

14562315243551 has 2 divisors, whose sum is σ = 14562315243552. Its totient is φ = 14562315243550.

The previous prime is 14562315243473. The next prime is 14562315243601. The reversal of 14562315243551 is 15534251326541.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 14562315243551 - 238 = 14287437336607 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 14562315243496 and 14562315243505.

It is a congruent number.

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

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

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

Almost surely, 214562315243551 is an apocalyptic number.

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

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

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

The product of its digits is 2160000, while the sum is 47.

The spelling of 14562315243551 in words is "fourteen trillion, five hundred sixty-two billion, three hundred fifteen million, two hundred forty-three thousand, five hundred fifty-one".