Search a number
-
+
11110010010997 is a prime number
BaseRepresentation
bin1010000110101100000000…
…1100110011110101110101
31110100002212200220021012011
42201223000030303311311
52424011300030322442
635343511303524221
72224446255640342
oct241530014636565
943302780807164
1011110010010997
1135a3802017477
1212b523ba59671
13627891a17811
142a5a27c037c9
15143ee45cd117
hexa1ac0333d75

11110010010997 has 2 divisors, whose sum is σ = 11110010010998. Its totient is φ = 11110010010996.

The previous prime is 11110010010959. The next prime is 11110010011027. The reversal of 11110010010997 is 79901001001111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10719246248676 + 390763762321 = 3274026^2 + 625111^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 11110010010997 - 215 = 11110009978229 is a prime.

It is a congruent number.

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

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

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

Almost surely, 211110010010997 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11110010010997 in words is "eleven trillion, one hundred ten billion, ten million, ten thousand, nine hundred ninety-seven".