Search a number
-
+
11132615441 is a prime number
BaseRepresentation
bin10100101111000111…
…00011101100010001
31001201211222110102102
422113203203230101
5140244422143231
65040402330145
7542606445533
oct122743435421
931654873372
1011132615441
1147a3086832
1221a8359955
13108554a71c
14778751853
15452537acb
hex2978e3b11

11132615441 has 2 divisors, whose sum is σ = 11132615442. Its totient is φ = 11132615440.

The previous prime is 11132615383. The next prime is 11132615447. The reversal of 11132615441 is 14451623111.

11132615441 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., 6470593600 + 4662021841 = 80440^2 + 68279^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 11132615441 - 214 = 11132599057 is a prime.

It is a super-3 number, since 3×111326154413 (a number of 31 digits) contains 333 as substring.

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

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

Almost surely, 211132615441 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2880, while the sum is 29.

The spelling of 11132615441 in words is "eleven billion, one hundred thirty-two million, six hundred fifteen thousand, four hundred forty-one".