Base | Representation |
---|---|
bin | 1010000110110011011101… |
… | …1010111101111001101001 |
3 | 1110100022001002121221122211 |
4 | 2201230313122331321221 |
5 | 2424024344103222141 |
6 | 35344441555045121 |
7 | 2224546654234114 |
oct | 241546732757151 |
9 | 43308032557584 |
10 | 11112010210921 |
11 | 35a4639090264 |
12 | 12b56b98a07a1 |
13 | 627b20231b79 |
14 | 2a5b7771157b |
15 | 1440aeeced81 |
hex | a1b376bde69 |
11112010210921 has 2 divisors, whose sum is σ = 11112010210922. Its totient is φ = 11112010210920.
The previous prime is 11112010210913. The next prime is 11112010211023. The reversal of 11112010210921 is 12901201021111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8514513905296 + 2597496305625 = 2917964^2 + 1611675^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112010210921 - 23 = 11112010210913 is a prime.
It is a super-2 number, since 2×111120102109212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11112010210892 and 11112010210901.
It is not a weakly prime, because it can be changed into another prime (11112010210321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556005105460 + 5556005105461.
It is an arithmetic number, because the mean of its divisors is an integer number (5556005105461).
Almost surely, 211112010210921 is an apocalyptic number.
It is an amenable number.
11112010210921 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112010210921 is an equidigital number, since it uses as much as digits as its factorization.
11112010210921 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 11112010210921 in words is "eleven trillion, one hundred twelve billion, ten million, two hundred ten thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •