Base | Representation |
---|---|
bin | 1010000110110011111000… |
… | …0101110011000100000101 |
3 | 1110100022022220011121101122 |
4 | 2201230332011303010011 |
5 | 2424030111224231041 |
6 | 35344501033203325 |
7 | 2224552513263203 |
oct | 241547605630405 |
9 | 43308286147348 |
10 | 11112122102021 |
11 | 35a4696263746 |
12 | 12b572b260545 |
13 | 627b3a479c15 |
14 | 2a5b8851a073 |
15 | 1440b9c32c4b |
hex | a1b3e173105 |
11112122102021 has 2 divisors, whose sum is σ = 11112122102022. Its totient is φ = 11112122102020.
The previous prime is 11112122102017. The next prime is 11112122102033. The reversal of 11112122102021 is 12020122121111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11100797949796 + 11324152225 = 3331786^2 + 106415^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112122102021 - 22 = 11112122102017 is a prime.
It is a super-2 number, since 2×111121221020212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11112122102051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556061051010 + 5556061051011.
It is an arithmetic number, because the mean of its divisors is an integer number (5556061051011).
Almost surely, 211112122102021 is an apocalyptic number.
It is an amenable number.
11112122102021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112122102021 is an equidigital number, since it uses as much as digits as its factorization.
11112122102021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11112122102021 its reverse (12020122121111), we get a palindrome (23132244223132).
The spelling of 11112122102021 in words is "eleven trillion, one hundred twelve billion, one hundred twenty-two million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •