Search a number
-
+
11013131989 is a prime number
BaseRepresentation
bin10100100000110111…
…10000111011010101
31001102112011001221101
422100123300323111
5140023330210424
65020453350101
7536626035346
oct122033607325
931375131841
1011013131989
114741698082
122174338331
131066874962
1476692c0cd
15446cd5344
hex2906f0ed5

11013131989 has 2 divisors, whose sum is σ = 11013131990. Its totient is φ = 11013131988.

The previous prime is 11013131977. The next prime is 11013132043. The reversal of 11013131989 is 98913131011.

11013131989 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., 6873239025 + 4139892964 = 82905^2 + 64342^2 .

It is a cyclic number.

It is not a de Polignac number, because 11013131989 - 215 = 11013099221 is a prime.

It is a super-2 number, since 2×110131319892 (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 (11013131939) 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, 5506565994 + 5506565995.

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

Almost surely, 211013131989 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5832, while the sum is 37.

The spelling of 11013131989 in words is "eleven billion, thirteen million, one hundred thirty-one thousand, nine hundred eighty-nine".