Search a number
-
+
10587301513 is a prime number
BaseRepresentation
bin10011101110000110…
…10110011010001001
31000022211212122100021
421313003112122021
5133140322122023
64510322340441
7523235402155
oct116703263211
930284778307
1010587301513
11454328a368
1220757ba721
13cc958b169
14726162065
1541e71d35d
hex2770d6689

10587301513 has 2 divisors, whose sum is σ = 10587301514. Its totient is φ = 10587301512.

The previous prime is 10587301507. The next prime is 10587301537. The reversal of 10587301513 is 31510378501.

10587301513 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., 5450425929 + 5136875584 = 73827^2 + 71672^2 .

It is a cyclic number.

It is not a de Polignac number, because 10587301513 - 225 = 10553747081 is a prime.

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

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

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

Almost surely, 210587301513 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10587301513 in words is "ten billion, five hundred eighty-seven million, three hundred one thousand, five hundred thirteen".