Search a number
-
+
10566975911 is a prime number
BaseRepresentation
bin10011101011101011…
…10100000110100111
31000021102121222212012
421311311310012213
5133120121212121
64504314544435
7522600545642
oct116565640647
930242558765
1010566975911
114532867448
12206aa3811b
13cc52c278b
14723590a59
1541ca55c5b
hex275d741a7

10566975911 has 2 divisors, whose sum is σ = 10566975912. Its totient is φ = 10566975910.

The previous prime is 10566975863. The next prime is 10566975959. The reversal of 10566975911 is 11957966501.

It is a balanced prime because it is at equal distance from previous prime (10566975863) and next prime (10566975959).

It is a cyclic number.

It is not a de Polignac number, because 10566975911 - 218 = 10566713767 is a prime.

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

It is a Sophie Germain prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 210566975911 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 510300, while the sum is 50.

The spelling of 10566975911 in words is "ten billion, five hundred sixty-six million, nine hundred seventy-five thousand, nine hundred eleven".