Base | Representation |
---|---|
bin | 1010000000111111101001… |
… | …0101000011010001111111 |
3 | 1102222202102012222210201111 |
4 | 2200033322111003101333 |
5 | 2420410441424031421 |
6 | 35230534005222451 |
7 | 2214414415040131 |
oct | 240177225032177 |
9 | 42882365883644 |
10 | 11012201002111 |
11 | 3566280418431 |
12 | 129a2a3a01a27 |
13 | 61b5a510402a |
14 | 2a0dc9b57051 |
15 | 1416bc8d0ee1 |
hex | a03fa54347f |
11012201002111 has 2 divisors, whose sum is σ = 11012201002112. Its totient is φ = 11012201002110.
The previous prime is 11012201002109. The next prime is 11012201002123. The reversal of 11012201002111 is 11120010221011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11012201002111 - 21 = 11012201002109 is a prime.
Together with 11012201002109, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11012201002091 and 11012201002100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012201002171) 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, 5506100501055 + 5506100501056.
It is an arithmetic number, because the mean of its divisors is an integer number (5506100501056).
Almost surely, 211012201002111 is an apocalyptic number.
11012201002111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012201002111 is an equidigital number, since it uses as much as digits as its factorization.
11012201002111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11012201002111 its reverse (11120010221011), we get a palindrome (22132211223122).
The spelling of 11012201002111 in words is "eleven trillion, twelve billion, two hundred one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •