Base | Representation |
---|---|
bin | 11001100000110000010000… |
… | …011110010011111011011110 |
3 | 112201021101222102211120121121 |
4 | 121200300100132103323132 |
5 | 104201304200004201420 |
6 | 1034344515501121154 |
7 | 32430220131055030 |
oct | 3140602036237336 |
9 | 481241872746547 |
10 | 112202002022110 |
11 | 32829669050000 |
12 | 107015bb5591ba |
13 | 4a7b7ac859560 |
14 | 1d9c86a735c50 |
15 | ce89717c62aa |
hex | 660c10793ede |
112202002022110 has 640 divisors, whose sum is σ = 278183082240000. Its totient is φ = 31725758592000.
The previous prime is 112202002022093. The next prime is 112202002022137. The reversal of 112202002022110 is 11220200202211.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 319 ways as a sum of consecutive naturals, for example, 267785207481 + ... + 267785207899.
It is an arithmetic number, because the mean of its divisors is an integer number (434661066000).
Almost surely, 2112202002022110 is an apocalyptic number.
112202002022110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112202002022110 is an abundant number, since it is smaller than the sum of its proper divisors (165981080217890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112202002022110 is a wasteful number, since it uses less digits than its factorization.
112202002022110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 790 (or 757 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 112202002022110 its reverse (11220200202211), we get a palindrome (123422202224321).
The spelling of 112202002022110 in words is "one hundred twelve trillion, two hundred two billion, two million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •