Search a number
-
+
11112002201123 is a prime number
BaseRepresentation
bin1010000110110011011011…
…1100011010011000100011
31110100022000112120000021122
42201230312330122120203
52424024340030413443
635344441111242455
72224546526163665
oct241546674323043
943308015500248
1011112002201123
1135a463460a39a
1212b56b707942b
13627b1b689145
142a5b76628535
151440ae44b968
hexa1b36f1a623

11112002201123 has 2 divisors, whose sum is σ = 11112002201124. Its totient is φ = 11112002201122.

The previous prime is 11112002201087. The next prime is 11112002201143. The reversal of 11112002201123 is 32110220021111.

It is a happy number.

11112002201123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11112002201123 - 26 = 11112002201059 is a prime.

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

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

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

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

Almost surely, 211112002201123 is an apocalyptic number.

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

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

11112002201123 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 48, while the sum is 17.

Adding to 11112002201123 its reverse (32110220021111), we get a palindrome (43222222222234).

The spelling of 11112002201123 in words is "eleven trillion, one hundred twelve billion, two million, two hundred one thousand, one hundred twenty-three".