Search a number
-
+
11002530569 is a prime number
BaseRepresentation
bin10100011111100110…
…10100101100001001
31001101210012110112012
422033303110230021
5140013121434234
65015434225305
7536436652412
oct121763245411
931353173465
1011002530569
114736707078
122170885235
131064602424
1476536c809
15445dde0ce
hex28fcd4b09

11002530569 has 2 divisors, whose sum is σ = 11002530570. Its totient is φ = 11002530568.

The previous prime is 11002530557. The next prime is 11002530589. The reversal of 11002530569 is 96503520011.

11002530569 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., 7493152969 + 3509377600 = 86563^2 + 59240^2 .

It is a cyclic number.

It is not a de Polignac number, because 11002530569 - 220 = 11001481993 is a prime.

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

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

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

Almost surely, 211002530569 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11002530569 in words is "eleven billion, two million, five hundred thirty thousand, five hundred sixty-nine".