Base | Representation |
---|---|
bin | 110100001001110111… |
… | …1010001111011011000 |
3 | 101201002111100022012200 |
4 | 1220103233101323120 |
5 | 3313334034423000 |
6 | 123241403210200 |
7 | 11043320635644 |
oct | 1502357217330 |
9 | 351074308180 |
10 | 112000311000 |
11 | 4355428a3a6 |
12 | 19858816960 |
13 | a73ba52996 |
14 | 55c6b1dc24 |
15 | 2da7a1c500 |
hex | 1a13bd1ed8 |
112000311000 has 192 divisors, whose sum is σ = 378777185280. Its totient is φ = 29849702400.
The previous prime is 112000310977. The next prime is 112000311067. The reversal of 112000311000 is 113000211.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 28231017 + ... + 28234983.
It is an arithmetic number, because the mean of its divisors is an integer number (1972797840).
Almost surely, 2112000311000 is an apocalyptic number.
112000311000 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 112000311000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189388592640).
112000311000 is an abundant number, since it is smaller than the sum of its proper divisors (266776874280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112000311000 is a wasteful number, since it uses less digits than its factorization.
112000311000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7131 (or 7114 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 112000311000 its reverse (113000211), we get a palindrome (112113311211).
The spelling of 112000311000 in words is "one hundred twelve billion, three hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •