Search a number
-
+
1101604335553 is a prime number
BaseRepresentation
bin10000000001111100101…
…111000010111111000001
310220022102200220110101001
4100001330233002333001
5121022041202214203
62202023044012001
7142405532232451
oct20017457027701
93808380813331
101101604335553
11395207a24047
121595b9091001
137cb5b29b557
143b4645a9d61
151d9c675991d
hex1007cbc2fc1

1101604335553 has 2 divisors, whose sum is σ = 1101604335554. Its totient is φ = 1101604335552.

The previous prime is 1101604335547. The next prime is 1101604335569. The reversal of 1101604335553 is 3555334061011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1097430141889 + 4174193664 = 1047583^2 + 64608^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101604335553 - 25 = 1101604335521 is a prime.

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

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

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

Almost surely, 21101604335553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 81000, while the sum is 37.

Adding to 1101604335553 its reverse (3555334061011), we get a palindrome (4656938396564).

The spelling of 1101604335553 in words is "one trillion, one hundred one billion, six hundred four million, three hundred thirty-five thousand, five hundred fifty-three".