Base | Representation |
---|---|
bin | 1010000110110100001111… |
… | …1011010000001111000101 |
3 | 1110100022120201101101211221 |
4 | 2201231003323100033011 |
5 | 2424030311310014341 |
6 | 35344514451400341 |
7 | 2224555112355463 |
oct | 241550373201705 |
9 | 43308521341757 |
10 | 11112220001221 |
11 | 35a473654a879 |
12 | 12b5757bb30b1 |
13 | 627b54836441 |
14 | 2a5b97521833 |
15 | 1440c361eed1 |
hex | a1b43ed03c5 |
11112220001221 has 2 divisors, whose sum is σ = 11112220001222. Its totient is φ = 11112220001220.
The previous prime is 11112220001213. The next prime is 11112220001249. The reversal of 11112220001221 is 12210002221111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6543292376196 + 4568927625025 = 2557986^2 + 2137505^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112220001221 - 23 = 11112220001213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11112220001195 and 11112220001204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11112220101221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556110000610 + 5556110000611.
It is an arithmetic number, because the mean of its divisors is an integer number (5556110000611).
Almost surely, 211112220001221 is an apocalyptic number.
It is an amenable number.
11112220001221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112220001221 is an equidigital number, since it uses as much as digits as its factorization.
11112220001221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11112220001221 its reverse (12210002221111), we get a palindrome (23322222222332).
The spelling of 11112220001221 in words is "eleven trillion, one hundred twelve billion, two hundred twenty million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •