Base | Representation |
---|---|
bin | 1010000110110011011011… |
… | …1000101000011101101110 |
3 | 1110100022000110200200000121 |
4 | 2201230312320220131232 |
5 | 2424024334302211342 |
6 | 35344441034115154 |
7 | 2224546514566033 |
oct | 241546670503556 |
9 | 43308013620017 |
10 | 11112001210222 |
11 | 35a4633aa2970 |
12 | 12b56b687baba |
13 | 627b1b400103 |
14 | 2a5b7644b38a |
15 | 1440ae303067 |
hex | a1b36e2876e |
11112001210222 has 8 divisors (see below), whose sum is σ = 18183274707672. Its totient is φ = 5050909641000.
The previous prime is 11112001210213. The next prime is 11112001210231. The reversal of 11112001210222 is 22201210021111.
It is an interprime number because it is at equal distance from previous prime (11112001210213) and next prime (11112001210231).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11112001210196 and 11112001210205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 252545482029 + ... + 252545482072.
It is an arithmetic number, because the mean of its divisors is an integer number (2272909338459).
Almost surely, 211112001210222 is an apocalyptic number.
11112001210222 is a deficient number, since it is larger than the sum of its proper divisors (7071273497450).
11112001210222 is a wasteful number, since it uses less digits than its factorization.
11112001210222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505090964114.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11112001210222 its reverse (22201210021111), we get a palindrome (33313211231333).
The spelling of 11112001210222 in words is "eleven trillion, one hundred twelve billion, one million, two hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •