Base | Representation |
---|---|
bin | 11001011101111110011110… |
… | …100011100000011000111110 |
3 | 112200121011020222222220112002 |
4 | 121131332132203200120332 |
5 | 104140142224212021342 |
6 | 1034121110010142302 |
7 | 32410351531400255 |
oct | 3135763643403076 |
9 | 480534228886462 |
10 | 112011112220222 |
11 | 327657117a7556 |
12 | 10690606a21992 |
13 | 4a667aaa91c67 |
14 | 1d9351c55379c |
15 | ce39ed049d32 |
hex | 65df9e8e063e |
112011112220222 has 8 divisors (see below), whose sum is σ = 168017404926672. Its totient is φ = 56005310578000.
The previous prime is 112011112220221. The next prime is 112011112220233. The reversal of 112011112220222 is 222022211110211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1120111122202222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112011112220194 and 112011112220203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112011112220221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 122195279 + ... + 123108522.
It is an arithmetic number, because the mean of its divisors is an integer number (21002175615834).
Almost surely, 2112011112220222 is an apocalyptic number.
112011112220222 is a deficient number, since it is larger than the sum of its proper divisors (56006292706450).
112011112220222 is a wasteful number, since it uses less digits than its factorization.
112011112220222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245532114.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 112011112220222 its reverse (222022211110211), we get a palindrome (334033323330433).
The spelling of 112011112220222 in words is "one hundred twelve trillion, eleven billion, one hundred twelve million, two hundred twenty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •