Base | Representation |
---|---|
bin | 11001011111010010011001… |
… | …100001100000001000100110 |
3 | 112200220202211220200012120110 |
4 | 121133102121201200020212 |
5 | 104143131300330401042 |
6 | 1034230331314113450 |
7 | 32420021534046240 |
oct | 3137223141401046 |
9 | 480822756605513 |
10 | 112101222122022 |
11 | 3279a952462481 |
12 | 106a5b7457b886 |
13 | 4a7213b5b3993 |
14 | 1d97a29c9d090 |
15 | ce6023d8509c |
hex | 65f499860226 |
112101222122022 has 64 divisors (see below), whose sum is σ = 265070400145920. Its totient is φ = 30924070119936.
The previous prime is 112101222121949. The next prime is 112101222122027. The reversal of 112101222122022 is 220221222101211.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 112101222122022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112101222122027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 99237633 + ... + 100360899.
It is an arithmetic number, because the mean of its divisors is an integer number (4141725002280).
Almost surely, 2112101222122022 is an apocalyptic number.
112101222122022 is an abundant number, since it is smaller than the sum of its proper divisors (152969178023898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112101222122022 is a wasteful number, since it uses less digits than its factorization.
112101222122022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1205245.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 112101222122022 its reverse (220221222101211), we get a palindrome (332322444223233).
The spelling of 112101222122022 in words is "one hundred twelve trillion, one hundred one billion, two hundred twenty-two million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •