Search a number
-
+
11389265159 is a prime number
BaseRepresentation
bin10101001101101101…
…00110010100000111
31002101201220121122112
422212312212110013
5141311122441114
65122051251235
7552144104456
oct124666462407
932351817575
1011389265159
114914a41538
12225a2a9b1b
1310c677aa6c
147a087cb9d
15469d3213e
hex2a6da6507

11389265159 has 2 divisors, whose sum is σ = 11389265160. Its totient is φ = 11389265158.

The previous prime is 11389265113. The next prime is 11389265161. The reversal of 11389265159 is 95156298311.

11389265159 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 is a cyclic number.

It is not a de Polignac number, because 11389265159 - 228 = 11120829703 is a prime.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 211389265159 is an apocalyptic number.

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

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

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

The product of its digits is 583200, while the sum is 50.

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