Search a number
-
+
561651113 is a prime number
BaseRepresentation
bin100001011110100…
…001110110101001
31110010211211111002
4201132201312221
52122240313423
6131422044345
716626645542
oct4136416651
91403754432
10561651113
11269045881
121381196b5
138c48c74a
14548434c9
1534495228
hex217a1da9

561651113 has 2 divisors, whose sum is σ = 561651114. Its totient is φ = 561651112.

The previous prime is 561651047. The next prime is 561651131. The reversal of 561651113 is 311156165.

561651113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

Together with next prime (561651131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 495196009 + 66455104 = 22253^2 + 8152^2 .

It is a cyclic number.

It is not a de Polignac number, because 561651113 - 28 = 561650857 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2561651113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2700, while the sum is 29.

The square root of 561651113 is about 23699.1795849561. The cubic root of 561651113 is about 825.0663493623.

The spelling of 561651113 in words is "five hundred sixty-one million, six hundred fifty-one thousand, one hundred thirteen".