Search a number
-
+
561901537 is a prime number
BaseRepresentation
bin100001011111011…
…110111111100001
31110011022120000001
4201133132333201
52122321322122
6131431300001
716632040621
oct4137367741
91404276001
10561901537
112691a6a3a
1213821a601
138c549722
14548aa881
15344e4527
hex217defe1

561901537 has 2 divisors, whose sum is σ = 561901538. Its totient is φ = 561901536.

The previous prime is 561901531. The next prime is 561901541. The reversal of 561901537 is 735109165.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 555120721 + 6780816 = 23561^2 + 2604^2 .

It is a cyclic number.

It is not a de Polignac number, because 561901537 - 27 = 561901409 is a prime.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 561901496 and 561901505.

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

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

Almost surely, 2561901537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28350, while the sum is 37.

The square root of 561901537 is about 23704.4623858041. The cubic root of 561901537 is about 825.1889555557.

The spelling of 561901537 in words is "five hundred sixty-one million, nine hundred one thousand, five hundred thirty-seven".