Search a number
-
+
561613849061 is a prime number
BaseRepresentation
bin10000010110000101100…
…10110100000111100101
31222200121211112112201012
420023002302310013211
533200141121132221
61110000221512005
755401212644346
oct10130262640745
91880554475635
10561613849061
111a71a7416211
1290a17412605
1340c6304c525
141d27a1740cd
15e91edbd65b
hex82c2cb41e5

561613849061 has 2 divisors, whose sum is σ = 561613849062. Its totient is φ = 561613849060.

The previous prime is 561613849033. The next prime is 561613849079. The reversal of 561613849061 is 160948316165.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 315850744036 + 245763105025 = 562006^2 + 495745^2 .

It is a cyclic number.

It is not a de Polignac number, because 561613849061 - 218 = 561613586917 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2561613849061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 561613849061 in words is "five hundred sixty-one billion, six hundred thirteen million, eight hundred forty-nine thousand, sixty-one".