Search a number
-
+
14109866916569 is a prime number
BaseRepresentation
bin1100110101010011010110…
…0110101111101011011001
31211221220000212220120222122
43031110311212233223121
53322134001412312234
650001552224231025
72654255440625504
oct315246546575331
954856025816878
1014109866916569
11454aa63038196
1216ba705a6b475
137b47299c5a58
1436acc7acc13b
1519706b4a892e
hexcd5359afad9

14109866916569 has 2 divisors, whose sum is σ = 14109866916570. Its totient is φ = 14109866916568.

The previous prime is 14109866916499. The next prime is 14109866916631. The reversal of 14109866916569 is 96561966890141.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12481997142169 + 1627869774400 = 3532987^2 + 1275880^2 .

It is a cyclic number.

It is not a de Polignac number, because 14109866916569 - 212 = 14109866912473 is a prime.

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

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

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

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

Almost surely, 214109866916569 is an apocalyptic number.

It is an amenable number.

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

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

14109866916569 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 151165440, while the sum is 71.

The spelling of 14109866916569 in words is "fourteen trillion, one hundred nine billion, eight hundred sixty-six million, nine hundred sixteen thousand, five hundred sixty-nine".