Search a number
-
+
11110132011109 is a prime number
BaseRepresentation
bin1010000110101100011101…
…1110001101000001100101
31110100010012012110111212211
42201223013132031001211
52424012022243323414
635343531342443421
72224452266631655
oct241530736150145
943303165414784
1011110132011109
1135a3864974a0a
1212b5274893571
136278b1091c31
142a5a3a0c0365
1514400017b3c4
hexa1ac778d065

11110132011109 has 2 divisors, whose sum is σ = 11110132011110. Its totient is φ = 11110132011108.

The previous prime is 11110132011071. The next prime is 11110132011131. The reversal of 11110132011109 is 90111023101111.

It is an a-pointer prime, because the next prime (11110132011131) can be obtained adding 11110132011109 to its sum of digits (22).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10978288222500 + 131843788609 = 3313350^2 + 363103^2 .

It is a cyclic number.

It is not a de Polignac number, because 11110132011109 - 29 = 11110132010597 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11110132011109.

It is a congruent number.

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

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

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

Almost surely, 211110132011109 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 22.

The spelling of 11110132011109 in words is "eleven trillion, one hundred ten billion, one hundred thirty-two million, eleven thousand, one hundred nine".