Search a number
-
+
10561511143 is a prime number
BaseRepresentation
bin10011101011000001…
…11101111011100111
31000021001100100121101
421311200331323213
5133112221324033
64504001500531
7522503235451
oct116540757347
930231310541
1010561511143
11452a774707
122069041747
13cc412b2a1
1472296b2d1
1541c32697d
hex27583dee7

10561511143 has 2 divisors, whose sum is σ = 10561511144. Its totient is φ = 10561511142.

The previous prime is 10561511099. The next prime is 10561511159. The reversal of 10561511143 is 34111516501.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10561511143 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 210561511143 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1800, while the sum is 28.

The spelling of 10561511143 in words is "ten billion, five hundred sixty-one million, five hundred eleven thousand, one hundred forty-three".