Search a number
-
+
10592530513 is a prime number
BaseRepresentation
bin10011101110101110…
…10011000001010001
31000100012201022011221
421313113103001101
5133143141434023
64511030405041
7523331011105
oct116727230121
930305638157
1010592530513
114546230a54
122077500781
13cca69c246
14726b23905
1541ee0285d
hex2775d3051

10592530513 has 2 divisors, whose sum is σ = 10592530514. Its totient is φ = 10592530512.

The previous prime is 10592530453. The next prime is 10592530537. The reversal of 10592530513 is 31503529501.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10272227904 + 320302609 = 101352^2 + 17897^2 .

It is a cyclic number.

It is not a de Polignac number, because 10592530513 - 221 = 10590433361 is a prime.

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

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

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

Almost surely, 210592530513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 20250, while the sum is 34.

The spelling of 10592530513 in words is "ten billion, five hundred ninety-two million, five hundred thirty thousand, five hundred thirteen".