Search a number
-
+
11051205569 is a prime number
BaseRepresentation
bin10100100101011010…
…00000001111000001
31001112011210102001222
422102231000033001
5140113102034234
65024333404425
7540600461135
oct122255001701
931464712058
1011051205569
114761132348
122185039715
1310717156c1
1476b9dd3c5
1544a30642e
hex292b403c1

11051205569 has 2 divisors, whose sum is σ = 11051205570. Its totient is φ = 11051205568.

The previous prime is 11051205511. The next prime is 11051205587. The reversal of 11051205569 is 96550215011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9430740544 + 1620465025 = 97112^2 + 40255^2 .

It is a cyclic number.

It is not a de Polignac number, because 11051205569 - 220 = 11050156993 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 211051205569 is an apocalyptic number.

It is an amenable number.

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

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

11051205569 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 35.

The spelling of 11051205569 in words is "eleven billion, fifty-one million, two hundred five thousand, five hundred sixty-nine".