Base | Representation |
---|---|
bin | 1101011000000… |
… | …11000011001010 |
3 | 21211010212100110 |
4 | 12230003003022 |
5 | 212211210442 |
6 | 15045015150 |
7 | 2531525133 |
oct | 654030312 |
9 | 254125313 |
10 | 112210122 |
11 | 58381142 |
12 | 316b44b6 |
13 | 1a32a32b |
14 | 10c8cc8a |
15 | 9cb769c |
hex | 6b030ca |
112210122 has 32 divisors (see below), whose sum is σ = 231465600. Its totient is φ = 36237888.
The previous prime is 112210121. The next prime is 112210129. The reversal of 112210122 is 221012211.
It is a super-2 number, since 2×1122101222 = 25182222958509768, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112210098 and 112210107.
It is not an unprimeable number, because it can be changed into a prime (112210121) 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, 58779 + ... + 60657.
It is an arithmetic number, because the mean of its divisors is an integer number (7233300).
Almost surely, 2112210122 is an apocalyptic number.
112210122 is an abundant number, since it is smaller than the sum of its proper divisors (119255478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112210122 is a wasteful number, since it uses less digits than its factorization.
112210122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2190.
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 112210122 is about 10592.9279238556. The cubic root of 112210122 is about 482.3297073253.
Adding to 112210122 its reverse (221012211), we get a palindrome (333222333).
It can be divided in two parts, 11 and 2210122, that multiplied together give a palindrome (24311342).
The spelling of 112210122 in words is "one hundred twelve million, two hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •