Base | Representation |
---|---|
bin | 1010000110110011100000… |
… | …0100100000101011001101 |
3 | 1110100022001212010020101202 |
4 | 2201230320010200223031 |
5 | 2424024404400220021 |
6 | 35344443024315245 |
7 | 2224550145632303 |
oct | 241547004405315 |
9 | 43308055106352 |
10 | 11112021101261 |
11 | 35a4644249343 |
12 | 12b5701472b25 |
13 | 627b22575a62 |
14 | 2a5b78d48273 |
15 | 1440b0e31a0b |
hex | a1b38120acd |
11112021101261 has 2 divisors, whose sum is σ = 11112021101262. Its totient is φ = 11112021101260.
The previous prime is 11112021101249. The next prime is 11112021101323. The reversal of 11112021101261 is 16210112021111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6996421755625 + 4115599345636 = 2645075^2 + 2028694^2 .
It is an emirp because it is prime and its reverse (16210112021111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11112021101261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11112021100261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556010550630 + 5556010550631.
It is an arithmetic number, because the mean of its divisors is an integer number (5556010550631).
Almost surely, 211112021101261 is an apocalyptic number.
It is an amenable number.
11112021101261 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112021101261 is an equidigital number, since it uses as much as digits as its factorization.
11112021101261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 20.
Adding to 11112021101261 its reverse (16210112021111), we get a palindrome (27322133122372).
The spelling of 11112021101261 in words is "eleven trillion, one hundred twelve billion, twenty-one million, one hundred one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •