Search a number
-
+
563012969 is a prime number
BaseRepresentation
bin100001100011101…
…110010101101001
31110020102000121012
4201203232111221
52123112403334
6131511153305
716644350141
oct4143562551
91406360535
10563012969
11269895a82
12138675835
138c84858c
1454ab9921
15346639ce
hex218ee569

563012969 has 2 divisors, whose sum is σ = 563012970. Its totient is φ = 563012968.

The previous prime is 563012963. The next prime is 563013019. The reversal of 563012969 is 969210365.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 540097600 + 22915369 = 23240^2 + 4787^2 .

It is a cyclic number.

It is not a de Polignac number, because 563012969 - 28 = 563012713 is a prime.

It is a super-2 number, since 2×5630129692 = 633967206524389922, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Chen prime.

It is an alternating number because its digits alternate between odd and even.

It is a Curzon number.

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

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

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

Almost surely, 2563012969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 87480, while the sum is 41.

The square root of 563012969 is about 23727.8943229272. The cubic root of 563012969 is about 825.7326672903.

The spelling of 563012969 in words is "five hundred sixty-three million, twelve thousand, nine hundred sixty-nine".