Base | Representation |
---|---|
bin | 1010000110110100010000… |
… | …0010111010101100001001 |
3 | 1110100022120212011110112122 |
4 | 2201231010002322230021 |
5 | 2424030312313310441 |
6 | 35344515002421025 |
7 | 2224555135423361 |
oct | 241550402725411 |
9 | 43308525143478 |
10 | 11112222010121 |
11 | 35a47376a2121 |
12 | 12b5758801775 |
13 | 627b5508a93b |
14 | 2a5b978c59a1 |
15 | 1440c38ba34b |
hex | a1b440bab09 |
11112222010121 has 2 divisors, whose sum is σ = 11112222010122. Its totient is φ = 11112222010120.
The previous prime is 11112222010093. The next prime is 11112222010139. The reversal of 11112222010121 is 12101022221111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6561082454521 + 4551139555600 = 2561461^2 + 2133340^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112222010121 - 238 = 10837344103177 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11112222010121.
It is not a weakly prime, because it can be changed into another prime (11112222019121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556111005060 + 5556111005061.
It is an arithmetic number, because the mean of its divisors is an integer number (5556111005061).
Almost surely, 211112222010121 is an apocalyptic number.
It is an amenable number.
11112222010121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112222010121 is an equidigital number, since it uses as much as digits as its factorization.
11112222010121 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 11112222010121 its reverse (12101022221111), we get a palindrome (23213244231232).
The spelling of 11112222010121 in words is "eleven trillion, one hundred twelve billion, two hundred twenty-two million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •