Search a number
-
+
5621705513 is a prime number
BaseRepresentation
bin1010011110001010…
…00110101100101001
3112111210020020012022
411033011012230221
543003124034023
62325500354225
7256211464664
oct51705065451
915453206168
105621705513
112425340616
12110a845975
136b78b6c88
143b48986db
1522d8107c8
hex14f146b29

5621705513 has 2 divisors, whose sum is σ = 5621705514. Its totient is φ = 5621705512.

The previous prime is 5621705501. The next prime is 5621705543. The reversal of 5621705513 is 3155071265.

5621705513 is digitally balanced in base 3, 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., 5596835344 + 24870169 = 74812^2 + 4987^2 .

It is a cyclic number.

It is not a de Polignac number, because 5621705513 - 224 = 5604928297 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 (5621705543) by changing a digit.

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

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

Almost surely, 25621705513 is an apocalyptic number.

It is an amenable number.

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

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

5621705513 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 31500, while the sum is 35.

The square root of 5621705513 is about 74978.0335364965. The cubic root of 5621705513 is about 1778.0993803275.

Adding to 5621705513 its reverse (3155071265), we get a palindrome (8776776778).

The spelling of 5621705513 in words is "five billion, six hundred twenty-one million, seven hundred five thousand, five hundred thirteen".