Search a number
-
+
11111000010133 is a prime number
BaseRepresentation
bin1010000110101111101100…
…1101010110110110010101
31110100012102200202102200211
42201223323031112312111
52424020312000311013
635344153431005421
72224512636536242
oct241537315266625
943305380672624
1011111000010133
1135a416a92a481
1212b5477509871
136279bbb6291a
142a5abd4aa5c9
1514405148623d
hexa1afb356d95

11111000010133 has 2 divisors, whose sum is σ = 11111000010134. Its totient is φ = 11111000010132.

The previous prime is 11111000010109. The next prime is 11111000010151. The reversal of 11111000010133 is 33101000011111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10911282187729 + 199717822404 = 3303223^2 + 446898^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 211111000010133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9, while the sum is 13.

Adding to 11111000010133 its reverse (33101000011111), we get a palindrome (44212000021244).

The spelling of 11111000010133 in words is "eleven trillion, one hundred eleven billion, ten thousand, one hundred thirty-three".