Base | Representation |
---|---|
bin | 110100010000001001… |
… | …1000101000010110000 |
3 | 101201122011211112100210 |
4 | 1220200103011002300 |
5 | 3314302010201000 |
6 | 123314331344120 |
7 | 11051456643510 |
oct | 1504023050260 |
9 | 351564745323 |
10 | 112211022000 |
11 | 43652218720 |
12 | 198b72b2040 |
13 | a7735ba34c |
14 | 5606acd840 |
15 | 2dbb290350 |
hex | 1a204c50b0 |
112211022000 has 640 divisors, whose sum is σ = 456270796800. Its totient is φ = 23046144000.
The previous prime is 112211021999. The next prime is 112211022013. The reversal of 112211022000 is 220112211.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 41116636 + ... + 41119364.
It is an arithmetic number, because the mean of its divisors is an integer number (712923120).
Almost surely, 2112211022000 is an apocalyptic number.
112211022000 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 112211022000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (228135398400).
112211022000 is an abundant number, since it is smaller than the sum of its proper divisors (344059774800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112211022000 is a wasteful number, since it uses less digits than its factorization.
112211022000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2862 (or 2846 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 112211022000 its reverse (220112211), we get a palindrome (112431134211).
The spelling of 112211022000 in words is "one hundred twelve billion, two hundred eleven million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •