Search a number
-
+
11101013200099 is a prime number
BaseRepresentation
bin1010000110001010011111…
…1100101100110011100011
31110022020122200210220210201
42201202213330230303203
52423334333334400344
635335422435010031
72224010312211064
oct241424774546343
943266580726721
1011101013200099
11359aa05604269
1212b354aa39917
13626a89b12c84
142a5412dbc56b
15143b698314d4
hexa18a7f2cce3

11101013200099 has 2 divisors, whose sum is σ = 11101013200100. Its totient is φ = 11101013200098.

The previous prime is 11101013200073. The next prime is 11101013200117. The reversal of 11101013200099 is 99000231010111.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11101013200099 - 213 = 11101013191907 is a prime.

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

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

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

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

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

Almost surely, 211101013200099 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 28.

The spelling of 11101013200099 in words is "eleven trillion, one hundred one billion, thirteen million, two hundred thousand, ninety-nine".