Search a number
-
+
10561235513 is a prime number
BaseRepresentation
bin10011101010111111…
…11010101000111001
31000021000211100111212
421311133322220321
5133112134014023
64503551532505
7522501010043
oct116537725071
930230740455
1010561235513
11452a5a6614
122068b2a135
13cc40629aa
147228d8a93
1541c2bee78
hex2757faa39

10561235513 has 2 divisors, whose sum is σ = 10561235514. Its totient is φ = 10561235512.

The previous prime is 10561235479. The next prime is 10561235537. The reversal of 10561235513 is 31553216501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10264121344 + 297114169 = 101312^2 + 17237^2 .

It is an emirp because it is prime and its reverse (31553216501) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10561235513 - 26 = 10561235449 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10561235513.

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

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

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

Almost surely, 210561235513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13500, while the sum is 32.

The spelling of 10561235513 in words is "ten billion, five hundred sixty-one million, two hundred thirty-five thousand, five hundred thirteen".