Base | Representation |
---|---|
bin | 110100001101110000… |
… | …1111011101111110000 |
3 | 101201102121022111222010 |
4 | 1220123201323233300 |
5 | 3314121020430000 |
6 | 123302353042520 |
7 | 11046466012623 |
oct | 1503341735760 |
9 | 351377274863 |
10 | 112131030000 |
11 | 43611052530 |
12 | 19894556440 |
13 | a75cb607c2 |
14 | 55da229dba |
15 | 2db423dd50 |
hex | 1a1b87bbf0 |
112131030000 has 800 divisors, whose sum is σ = 415465408512. Its totient is φ = 25804800000.
The previous prime is 112131029981. The next prime is 112131030001. The reversal of 112131030000 is 30131211.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112131030001) by changing a digit.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 992309944 + ... + 992310056.
Almost surely, 2112131030000 is an apocalyptic number.
112131030000 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 112131030000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (207732704256).
112131030000 is an abundant number, since it is smaller than the sum of its proper divisors (303334378512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112131030000 is a wasteful number, since it uses less digits than its factorization.
112131030000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283 (or 262 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 112131030000 its reverse (30131211), we get a palindrome (112161161211).
The spelling of 112131030000 in words is "one hundred twelve billion, one hundred thirty-one million, thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •