Base | Representation |
---|---|
bin | 100001001001000… |
… | …0000010101011110 |
3 | 2212111110021111000 |
4 | 1002102000111132 |
5 | 4234134004342 |
6 | 302202211130 |
7 | 36361660542 |
oct | 10222002536 |
9 | 2774407430 |
10 | 1112016222 |
11 | 520782279 |
12 | 2704b3aa6 |
13 | 1494ca185 |
14 | a7989a22 |
15 | 6795b44c |
hex | 4248055e |
1112016222 has 32 divisors (see below), whose sum is σ = 2495151360. Its totient is φ = 367071480.
The previous prime is 1112016203. The next prime is 1112016229. The reversal of 1112016222 is 2226102111.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1112016195 and 1112016204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112016229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94404 + ... + 105527.
It is an arithmetic number, because the mean of its divisors is an integer number (77973480).
Almost surely, 21112016222 is an apocalyptic number.
1112016222 is an abundant number, since it is smaller than the sum of its proper divisors (1383135138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112016222 is a wasteful number, since it uses less digits than its factorization.
1112016222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200045 (or 200039 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 1112016222 is about 33346.9072329054. The cubic root of 1112016222 is about 1036.0253313176.
Adding to 1112016222 its reverse (2226102111), we get a palindrome (3338118333).
The spelling of 1112016222 in words is "one billion, one hundred twelve million, sixteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •