Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …0101100111101111101111 |
3 | 1110022100012112220112000202 |
4 | 2201203202311213233233 |
5 | 2423343344301400421 |
6 | 35340104451144115 |
7 | 2224043640112433 |
oct | 241434265475757 |
9 | 43270175815022 |
10 | 11102001200111 |
11 | 35a03722812a8 |
12 | 12b37858a503b |
13 | 626bb670b173 |
14 | 2a54a82c49c3 |
15 | 143bc644210b |
hex | a18e2d67bef |
11102001200111 has 2 divisors, whose sum is σ = 11102001200112. Its totient is φ = 11102001200110.
The previous prime is 11102001200107. The next prime is 11102001200113. The reversal of 11102001200111 is 11100210020111.
It is a strong prime.
It is an emirp because it is prime and its reverse (11100210020111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11102001200111 - 22 = 11102001200107 is a prime.
Together with 11102001200113, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 11102001200092 and 11102001200101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11102001200113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551000600055 + 5551000600056.
It is an arithmetic number, because the mean of its divisors is an integer number (5551000600056).
Almost surely, 211102001200111 is an apocalyptic number.
11102001200111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102001200111 is an equidigital number, since it uses as much as digits as its factorization.
11102001200111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11102001200111 its reverse (11100210020111), we get a palindrome (22202211220222).
The spelling of 11102001200111 in words is "eleven trillion, one hundred two billion, one million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •