Search a number
-
+
11101585455353 is a prime number
BaseRepresentation
bin1010000110001100101000…
…0011101011100011111001
31110022022010120121111102202
42201203022003223203321
52423342021334032403
635335555320235545
72224030431253541
oct241431203534371
943268116544382
1011101585455353
1135a0179632098
1212b368a60bbb5
13626b4b546253
142a5468dc2321
15143b9ebbd688
hexa18ca0eb8f9

11101585455353 has 2 divisors, whose sum is σ = 11101585455354. Its totient is φ = 11101585455352.

The previous prime is 11101585455347. The next prime is 11101585455391. The reversal of 11101585455353 is 35355458510111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10991260504249 + 110324951104 = 3315307^2 + 332152^2 .

It is a cyclic number.

It is not a de Polignac number, because 11101585455353 - 220 = 11101584406777 is a prime.

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

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

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

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

Almost surely, 211101585455353 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 900000, while the sum is 47.

The spelling of 11101585455353 in words is "eleven trillion, one hundred one billion, five hundred eighty-five million, four hundred fifty-five thousand, three hundred fifty-three".