Base | Representation |
---|---|
bin | 11001011101110100001110… |
… | …111001110101101111000000 |
3 | 112200120002212101120001111221 |
4 | 121131310032321311233000 |
5 | 104140002212212033440 |
6 | 1034112050302044424 |
7 | 32406512122060114 |
oct | 3135641671655700 |
9 | 480502771501457 |
10 | 112000112221120 |
11 | 32760a8756a402 |
12 | 1068a456b79714 |
13 | 4a65746b67b56 |
14 | 1d92b97683744 |
15 | ce35a74aad4a |
hex | 65dd0ee75bc0 |
112000112221120 has 112 divisors (see below), whose sum is σ = 297251072105760. Its totient is φ = 39945550823424.
The previous prime is 112000112221111. The next prime is 112000112221181. The reversal of 112000112221120 is 21122211000211.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 112000112221094 and 112000112221103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 541692849 + ... + 541899568.
Almost surely, 2112000112221120 is an apocalyptic number.
112000112221120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112000112221120 is an abundant number, since it is smaller than the sum of its proper divisors (185250959884640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112000112221120 is a wasteful number, since it uses less digits than its factorization.
112000112221120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1083592470 (or 1083592460 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 112000112221120 its reverse (21122211000211), we get a palindrome (133122323221331).
The spelling of 112000112221120 in words is "one hundred twelve trillion, one hundred twelve million, two hundred twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •