Search a number
-
+
1101220515553 is a prime number
BaseRepresentation
bin10000000001100101110…
…110111000111011100001
310220021102221200101022111
4100001211312320323201
5121020244422444203
62201521013235321
7142363161636634
oct20014566707341
93807387611274
101101220515553
113950302aa434
12159510632b41
137cac9903722
143b429617c1b
151d9a2be026d
hex10065db8ee1

1101220515553 has 2 divisors, whose sum is σ = 1101220515554. Its totient is φ = 1101220515552.

The previous prime is 1101220515541. The next prime is 1101220515587. The reversal of 1101220515553 is 3555150221011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 817635509824 + 283585005729 = 904232^2 + 532527^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1101220515553 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21101220515553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7500, while the sum is 31.

Adding to 1101220515553 its reverse (3555150221011), we get a palindrome (4656370736564).

The spelling of 1101220515553 in words is "one trillion, one hundred one billion, two hundred twenty million, five hundred fifteen thousand, five hundred fifty-three".