Base | Representation |
---|---|
bin | 10000001011101000011… |
… | …011100110010001010000 |
3 | 10221022021021021101020210 |
4 | 100023220123212101100 |
5 | 121204334241023440 |
6 | 2210502443004120 |
7 | 143224265326464 |
oct | 20135033462120 |
9 | 3838237241223 |
10 | 1112001111120 |
11 | 399662701449 |
12 | 15b61ab09640 |
13 | 80b2723b763 |
14 | 3bb6d2d44a4 |
15 | 1ddd4390a80 |
hex | 102e86e6450 |
1112001111120 has 160 divisors (see below), whose sum is σ = 3597911218944. Its totient is φ = 283842457600.
The previous prime is 1112001111113. The next prime is 1112001111181. The reversal of 1112001111120 is 211111002111.
It is a super-2 number, since 2×11120011111202 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1112001111096 and 1112001111105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 544596 + ... + 1587635.
Almost surely, 21112001111120 is an apocalyptic number.
1112001111120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1112001111120 is an abundant number, since it is smaller than the sum of its proper divisors (2485910107824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112001111120 is a wasteful number, since it uses less digits than its factorization.
1112001111120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2132341 (or 2132335 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1112001111120 its reverse (211111002111), we get a palindrome (1323112113231).
The spelling of 1112001111120 in words is "one trillion, one hundred twelve billion, one million, one hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •