Search a number
-
+
11101451521 is a prime number
BaseRepresentation
bin10100101011011001…
…01011010100000001
31001122200100011120011
422111230223110001
5140213432422041
65033330344521
7542050531606
oct122554532401
931580304504
1011101451521
114787530926
122199a2b141
13107bc58a34
1477455c6ad
1544e92de81
hex295b2b501

11101451521 has 2 divisors, whose sum is σ = 11101451522. Its totient is φ = 11101451520.

The previous prime is 11101451519. The next prime is 11101451587. The reversal of 11101451521 is 12515410111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11016811521 + 84640000 = 104961^2 + 9200^2 .

It is a cyclic number.

It is not a de Polignac number, because 11101451521 - 21 = 11101451519 is a prime.

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

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

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

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

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

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

Almost surely, 211101451521 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 200, while the sum is 22.

Adding to 11101451521 its reverse (12515410111), we get a palindrome (23616861632).

The spelling of 11101451521 in words is "eleven billion, one hundred one million, four hundred fifty-one thousand, five hundred twenty-one".