Search a number
-
+
11131303220993 is a prime number
BaseRepresentation
bin1010000111111011010101…
…0111111101011100000001
31110102010211122211102001102
42201332311113331130001
52424333402111032433
635401352231144145
72226132033144644
oct241766527753401
943363748742042
1011131303220993
11360183952628a
1212b93a2b15055
136298a62c0967
142a6a87b5da5b
1514483db474e8
hexa1fb55fd701

11131303220993 has 2 divisors, whose sum is σ = 11131303220994. Its totient is φ = 11131303220992.

The previous prime is 11131303220971. The next prime is 11131303221029. The reversal of 11131303220993 is 39902230313111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9184002982144 + 1947300238849 = 3030512^2 + 1395457^2 .

It is an emirp because it is prime and its reverse (39902230313111) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11131303220993 - 216 = 11131303155457 is a prime.

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

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

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

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

Almost surely, 211131303220993 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 26244, while the sum is 38.

The spelling of 11131303220993 in words is "eleven trillion, one hundred thirty-one billion, three hundred three million, two hundred twenty thousand, nine hundred ninety-three".