Base | Representation |
---|---|
bin | 110100001100110101… |
… | …1100110110011000000 |
3 | 101201100102221121011200 |
4 | 1220121223212303000 |
5 | 3314040100324300 |
6 | 123255324141200 |
7 | 11045641242042 |
oct | 1503153466300 |
9 | 351312847150 |
10 | 112100011200 |
11 | 435a5596661 |
12 | 19886097800 |
13 | a7565bcb98 |
14 | 55d6073a92 |
15 | 2db1663200 |
hex | 1a19ae6cc0 |
112100011200 has 126 divisors (see below), whose sum is σ = 398429959044. Its totient is φ = 29893332480.
The previous prime is 112100011189. The next prime is 112100011207. The reversal of 112100011200 is 2110001211.
It is a happy number.
It is a super-2 number, since 2×1121000112002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (112100011207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 3877962 + ... + 3906761.
Almost surely, 2112100011200 is an apocalyptic number.
112100011200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112100011200 is an abundant number, since it is smaller than the sum of its proper divisors (286329947844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112100011200 is a wasteful number, since it uses less digits than its factorization.
112100011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7784751 (or 7784733 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 112100011200 its reverse (2110001211), we get a palindrome (114210012411).
The spelling of 112100011200 in words is "one hundred twelve billion, one hundred million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •