Search a number
-
+
11132011232009 is a prime number
BaseRepresentation
bin1010000111111101111110…
…0100110011101100001001
31110102012200000002002120122
42201333133210303230021
52424341324333411014
635401550402233025
72226155421143003
oct241773744635411
943365600062518
1011132011232009
113602072147458
1212b9560055775
13629989ba64a5
142a6b13bc1373
15144880d9d58e
hexa1fdf933b09

11132011232009 has 2 divisors, whose sum is σ = 11132011232010. Its totient is φ = 11132011232008.

The previous prime is 11132011232003. The next prime is 11132011232011. The reversal of 11132011232009 is 90023211023111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10785969640000 + 346041592009 = 3284200^2 + 588253^2 .

It is an emirp because it is prime and its reverse (90023211023111) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11132011232009 - 212 = 11132011227913 is a prime.

Together with 11132011232011, 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 (11132011232003) by changing a digit.

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

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

Almost surely, 211132011232009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 26.

The spelling of 11132011232009 in words is "eleven trillion, one hundred thirty-two billion, eleven million, two hundred thirty-two thousand, nine".