Search a number
-
+
563704046413 is a prime number
BaseRepresentation
bin10000011001111110110…
…00010010001101001101
31222220000111121120102221
420030333120102031031
533213431213441123
61110543450015341
755504053223234
oct10147730221515
91886014546387
10563704046413
111a807a269442
12912bb417551
13412070b75b1
141d3d79cbb1b
15e9e364b25d
hex833f61234d

563704046413 has 2 divisors, whose sum is σ = 563704046414. Its totient is φ = 563704046412.

The previous prime is 563704046377. The next prime is 563704046419. The reversal of 563704046413 is 314640407365.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 563440893129 + 263153284 = 750627^2 + 16222^2 .

It is a cyclic number.

It is not a de Polignac number, because 563704046413 - 237 = 426265092941 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 563704046413.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (563704046419) 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, 281852023206 + 281852023207.

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

Almost surely, 2563704046413 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 725760, while the sum is 43.

The spelling of 563704046413 in words is "five hundred sixty-three billion, seven hundred four million, forty-six thousand, four hundred thirteen".