Search a number
-
+
11140591409 is a prime number
BaseRepresentation
bin10100110000000011…
…11110111100110001
31001202101222200101122
422120001332330301
5140303442411114
65041245312025
7543034315223
oct123001767461
931671880348
1011140591409
1147a7634242
1221aab65615
1310870b0c2c
1477982a413
154530b0e8e
hex29807ef31

11140591409 has 2 divisors, whose sum is σ = 11140591410. Its totient is φ = 11140591408.

The previous prime is 11140591333. The next prime is 11140591411. The reversal of 11140591409 is 90419504111.

11140591409 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7826056225 + 3314535184 = 88465^2 + 57572^2 .

It is a cyclic number.

It is not a de Polignac number, because 11140591409 - 228 = 10872155953 is a prime.

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

Together with 11140591411, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 211140591409 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6480, while the sum is 35.

The spelling of 11140591409 in words is "eleven billion, one hundred forty million, five hundred ninety-one thousand, four hundred nine".