Base | Representation |
---|---|
bin | 11110101111000011000… |
… | …110100100100110001110 |
3 | 21110220201000221210002110 |
4 | 132233003012210212032 |
5 | 234101041132102342 |
6 | 4254141504404450 |
7 | 305410601446206 |
oct | 36570306444616 |
9 | 7426630853073 |
10 | 2112102222222 |
11 | 744812707633 |
12 | 2a140a916726 |
13 | 12422a449745 |
14 | 74324d3b406 |
15 | 39e1992ac9c |
hex | 1ebc31a498e |
2112102222222 has 8 divisors (see below), whose sum is σ = 4224204444456. Its totient is φ = 704034074072.
The previous prime is 2112102222199. The next prime is 2112102222239. The reversal of 2112102222222 is 2222222012112.
It is a sphenic number, since it is the product of 3 distinct primes.
2112102222222 is an admirable number.
It is a super-2 number, since 2×21121022222222 (a number of 25 digits) contains 22 as substring.
2112102222222 is a modest number, since divided by 2222222 gives 211210 as remainder.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 176008518513 + ... + 176008518524.
It is an arithmetic number, because the mean of its divisors is an integer number (528025555557).
Almost surely, 22112102222222 is an apocalyptic number.
2112102222222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112102222222 is a wasteful number, since it uses less digits than its factorization.
2112102222222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352017037042.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 2112102222222 its reverse (2222222012112), we get a palindrome (4334324234334).
The spelling of 2112102222222 in words is "two trillion, one hundred twelve billion, one hundred two million, two hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •