Search a number
-
+
564015075204671 is a prime number
BaseRepresentation
bin1000000000111101111111111…
…0001101001001111000111111
32201222000022111100022121102122
42000033133332031021320333
51042411310333223022141
65315320540520113155
7226541513231300456
oct20017377615117077
92658008440277378
10564015075204671
111537924a5123982
1253311a976057bb
131b29351632844c
149d3c6922d1b9d
1545314d6b7864b
hex200f7fe349e3f

564015075204671 has 2 divisors, whose sum is σ = 564015075204672. Its totient is φ = 564015075204670.

The previous prime is 564015075204661. The next prime is 564015075204701. The reversal of 564015075204671 is 176402570510465.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 564015075204671 - 246 = 493646331027007 is a prime.

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

It is a Sophie Germain prime.

It is a congruent number.

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

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

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

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

Almost surely, 2564015075204671 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 7056000, while the sum is 53.

The spelling of 564015075204671 in words is "five hundred sixty-four trillion, fifteen billion, seventy-five million, two hundred four thousand, six hundred seventy-one".