Base | Representation |
---|---|
bin | 110100010000011010… |
… | …1101101110101110000 |
3 | 101201122210220211210002 |
4 | 1220200311231311300 |
5 | 3314311321231000 |
6 | 123315254125132 |
7 | 11051630062016 |
oct | 1504065556560 |
9 | 351583824702 |
10 | 112220102000 |
11 | 4365735a656 |
12 | 198ba3507a8 |
13 | a775449226 |
14 | 5607db48b6 |
15 | 2dbbe858d5 |
hex | 1a20d6dd70 |
112220102000 has 160 divisors (see below), whose sum is σ = 276043832064. Its totient is φ = 44118048000.
The previous prime is 112220101999. The next prime is 112220102009. The reversal of 112220102000 is 201022211.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112220102009) 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, 28031999 + ... + 28036001.
Almost surely, 2112220102000 is an apocalyptic number.
112220102000 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 112220102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (138021916032).
112220102000 is an abundant number, since it is smaller than the sum of its proper divisors (163823730064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112220102000 is a wasteful number, since it uses less digits than its factorization.
112220102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4264 (or 4248 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 112220102000 its reverse (201022211), we get a palindrome (112421124211).
The spelling of 112220102000 in words is "one hundred twelve billion, two hundred twenty million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •