Search a number
-
+
11110011109489 is a prime number
BaseRepresentation
bin1010000110101100000001…
…0001000000000001110001
31110100002212202222002001001
42201223000101000001301
52424011300321000424
635343511343242001
72224446301164055
oct241530021000161
943302782862031
1011110011109489
1135a38026a7816
1212b52402a9301
13627892010806
142a5a2800bc65
15143ee4748844
hexa1ac0440071

11110011109489 has 2 divisors, whose sum is σ = 11110011109490. Its totient is φ = 11110011109488.

The previous prime is 11110011109453. The next prime is 11110011109513. The reversal of 11110011109489 is 98490111001111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10497600000000 + 612411109489 = 3240000^2 + 782567^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11110011109489 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 211110011109489 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11110011109489 in words is "eleven trillion, one hundred ten billion, eleven million, one hundred nine thousand, four hundred eighty-nine".