Search a number
-
+
11021120114533 is a prime number
BaseRepresentation
bin1010000001100000110111…
…1100110000111101100101
31110000121102210212122211121
42200120031330300331211
52421032223222131113
635235011020533541
72215151426200264
oct240301574607545
943017383778747
1011021120114533
11356a037a91621
12129bb729b12b1
1361c396ba2c49
142a15d45145db
15141a40930e8d
hexa060df30f65

11021120114533 has 2 divisors, whose sum is σ = 11021120114534. Its totient is φ = 11021120114532.

The previous prime is 11021120114449. The next prime is 11021120114539. The reversal of 11021120114533 is 33541102112011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8296715681604 + 2724404432929 = 2880402^2 + 1650577^2 .

It is a cyclic number.

It is not a de Polignac number, because 11021120114533 - 213 = 11021120106341 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11021120114498 and 11021120114507.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11021120114539) by changing a digit.

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

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

Almost surely, 211021120114533 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 720, while the sum is 25.

Adding to 11021120114533 its reverse (33541102112011), we get a palindrome (44562222226544).

The spelling of 11021120114533 in words is "eleven trillion, twenty-one billion, one hundred twenty million, one hundred fourteen thousand, five hundred thirty-three".