Base | Representation |
---|---|
bin | 110011101111111011… |
… | …1010110010111110000 |
3 | 101121211211201111012210 |
4 | 1213133313112113300 |
5 | 3310043240323440 |
6 | 123015153452120 |
7 | 11012622336342 |
oct | 1473767262760 |
9 | 347754644183 |
10 | 111130011120 |
11 | 43147aa31a7 |
12 | 19655271040 |
13 | a63065793b |
14 | 55432d5292 |
15 | 2d5640aa80 |
hex | 19dfdd65f0 |
111130011120 has 80 divisors (see below), whose sum is σ = 344628112032. Its totient is φ = 29623910400.
The previous prime is 111130011101. The next prime is 111130011127. The reversal of 111130011120 is 21110031111.
It is a tau number, because it is divible by the number of its divisors (80).
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 = 111130011096 and 111130011105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111130011127) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 589584 + ... + 754896.
Almost surely, 2111130011120 is an apocalyptic number.
111130011120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111130011120 is an abundant number, since it is smaller than the sum of its proper divisors (233498100912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111130011120 is a wasteful number, since it uses less digits than its factorization.
111130011120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168130 (or 168124 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 111130011120 its reverse (21110031111), we get a palindrome (132240042231).
The spelling of 111130011120 in words is "one hundred eleven billion, one hundred thirty million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •