Search a number
-
+
11100933902137 is a prime number
BaseRepresentation
bin1010000110001010001100…
…1110001100111100111001
31110022020110011121011110011
42201202203032030330321
52423334203034332022
635335410523221521
72224005330200512
oct241424316147471
943266404534404
1011100933902137
11359a974872562
1212b35283778a1
13626a7656a2c1
142a5406659a09
15143b628ba977
hexa18a338cf39

11100933902137 has 2 divisors, whose sum is σ = 11100933902138. Its totient is φ = 11100933902136.

The previous prime is 11100933902063. The next prime is 11100933902141. The reversal of 11100933902137 is 73120933900111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11020833015696 + 80100886441 = 3319764^2 + 283021^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 211100933902137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30618, while the sum is 40.

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