Base | Representation |
---|---|
bin | 1010000111010010000000… |
… | …1010101110100000111110 |
3 | 1110101002012120000000102022 |
4 | 2201310200022232200332 |
5 | 2424143142230342342 |
6 | 35352315353200142 |
7 | 2225260112343263 |
oct | 241644012564076 |
9 | 43332176000368 |
10 | 11120210012222 |
11 | 35a8066715353 |
12 | 12b7207a00052 |
13 | 628828c8c9bc |
14 | 2a631474926a |
15 | 1443dece59d2 |
hex | a1d202ae83e |
11120210012222 has 8 divisors (see below), whose sum is σ = 17035215338016. Its totient is φ = 5441804899552.
The previous prime is 11120210012213. The next prime is 11120210012231. The reversal of 11120210012222 is 22221001202111.
It is an interprime number because it is at equal distance from previous prime (11120210012213) and next prime (11120210012231).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11120210012222.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59150053163 + ... + 59150053350.
It is an arithmetic number, because the mean of its divisors is an integer number (2129401917252).
Almost surely, 211120210012222 is an apocalyptic number.
11120210012222 is a deficient number, since it is larger than the sum of its proper divisors (5915005325794).
11120210012222 is a wasteful number, since it uses less digits than its factorization.
11120210012222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118300106562.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11120210012222 its reverse (22221001202111), we get a palindrome (33341211214333).
The spelling of 11120210012222 in words is "eleven trillion, one hundred twenty billion, two hundred ten million, twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •