Base | Representation |
---|---|
bin | 110100010000011101… |
… | …0110100100011110000 |
3 | 101201122220102211111112 |
4 | 1220200322310203300 |
5 | 3314312142041430 |
6 | 123315342532452 |
7 | 11051644334420 |
oct | 1504072644360 |
9 | 351586384445 |
10 | 112221440240 |
11 | 43658094038 |
12 | 198ba897128 |
13 | a7757c73a0 |
14 | 5608242480 |
15 | 2dbc14c195 |
hex | 1a20eb48f0 |
112221440240 has 160 divisors (see below), whose sum is σ = 325192519680. Its totient is φ = 35066483712.
The previous prime is 112221440203. The next prime is 112221440299. The reversal of 112221440240 is 42044122211.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 477557 + ... + 672683.
It is an arithmetic number, because the mean of its divisors is an integer number (2032453248).
Almost surely, 2112221440240 is an apocalyptic number.
112221440240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112221440240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162596259840).
112221440240 is an abundant number, since it is smaller than the sum of its proper divisors (212971079440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112221440240 is a wasteful number, since it uses less digits than its factorization.
112221440240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 195239 (or 195233 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 112221440240 its reverse (42044122211), we get a palindrome (154265562451).
The spelling of 112221440240 in words is "one hundred twelve billion, two hundred twenty-one million, four hundred forty thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •