Search a number
-
+
5394652564913 is a prime number
BaseRepresentation
bin100111010000000101001…
…0110011000110110110001
3201002201112121112122111122
41032200022112120312301
51201341222024034123
615250134050352025
71064515343133323
oct116401226306661
921081477478448
105394652564913
11179a94a809817
1273162a28b615
133019378a8121
14149161687613
15954d9934bc8
hex4e80a598db1

5394652564913 has 2 divisors, whose sum is σ = 5394652564914. Its totient is φ = 5394652564912.

The previous prime is 5394652564909. The next prime is 5394652564921. The reversal of 5394652564913 is 3194652564935.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5047157641744 + 347494923169 = 2246588^2 + 589487^2 .

It is a cyclic number.

It is not a de Polignac number, because 5394652564913 - 22 = 5394652564909 is a prime.

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

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

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

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

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

Almost surely, 25394652564913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 104976000, while the sum is 62.

The spelling of 5394652564913 in words is "five trillion, three hundred ninety-four billion, six hundred fifty-two million, five hundred sixty-four thousand, nine hundred thirteen".