Base | Representation |
---|---|
bin | 11001000010010100111110… |
… | …010000001100011010111000 |
3 | 112102212112001100022110120010 |
4 | 121002110332100030122320 |
5 | 103413030033434000440 |
6 | 1030104203424301520 |
7 | 32123160140446122 |
oct | 3102247620143270 |
9 | 472775040273503 |
10 | 110111121000120 |
11 | 320a2956239289 |
12 | 104243337718a0 |
13 | 4959584ac2736 |
14 | 1d29599d6c212 |
15 | cae399e3d580 |
hex | 64253e40c6b8 |
110111121000120 has 128 divisors (see below), whose sum is σ = 330869570990400. Its totient is φ = 29315315367936.
The previous prime is 110111121000103. The next prime is 110111121000131. The reversal of 110111121000120 is 21000121111011.
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 = 110111121000096 and 110111121000105.
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, 577439832 + ... + 577630488.
Almost surely, 2110111121000120 is an apocalyptic number.
110111121000120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110111121000120 is an abundant number, since it is smaller than the sum of its proper divisors (220758449990280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110111121000120 is a wasteful number, since it uses less digits than its factorization.
110111121000120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 198457 (or 198453 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110111121000120 its reverse (21000121111011), we get a palindrome (131111242111131).
The spelling of 110111121000120 in words is "one hundred ten trillion, one hundred eleven billion, one hundred twenty-one million, one hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •