Base | Representation |
---|---|
bin | 11010011101110… |
… | …10001011010000 |
3 | 120110202101100211 |
4 | 31032322023100 |
5 | 423313341422 |
6 | 34010253504 |
7 | 5334033430 |
oct | 1516721320 |
9 | 513671324 |
10 | 222012112 |
11 | 104357a93 |
12 | 62427294 |
13 | 36cc351a |
14 | 216b22c0 |
15 | 14756577 |
hex | d3ba2d0 |
222012112 has 120 divisors (see below), whose sum is σ = 551224640. Its totient is φ = 84837888.
The previous prime is 222012083. The next prime is 222012121. The reversal of 222012112 is 211210222.
It is a happy number.
222012112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 222012092 and 222012101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11684839 + ... + 11684857.
Almost surely, 2222012112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 222012112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (275612320).
222012112 is an abundant number, since it is smaller than the sum of its proper divisors (329212528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222012112 is an equidigital number, since it uses as much as digits as its factorization.
222012112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106 (or 45 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 222012112 is about 14900.0708723147. The cubic root of 222012112 is about 605.5159062756.
Adding to 222012112 its reverse (211210222), we get a palindrome (433222334).
The spelling of 222012112 in words is "two hundred twenty-two million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •