Search a number
-
+
5605014450569 is a prime number
BaseRepresentation
bin101000110010000010011…
…1001010011000110001001
3201211211112002112122220212
41101210010321103012021
51213313032144404234
615530524051530505
71115643324511442
oct121440471230611
921754462478825
105605014450569
111871089597a86
12766357bb9a35
1331872086c891
141553d99b02c9
159abec8ec5ce
hex51904e53189

5605014450569 has 2 divisors, whose sum is σ = 5605014450570. Its totient is φ = 5605014450568.

The previous prime is 5605014450559. The next prime is 5605014450667. The reversal of 5605014450569 is 9650544105065.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4688805583225 + 916208867344 = 2165365^2 + 957188^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 25605014450569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240000, while the sum is 50.

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