Base | Representation |
---|---|
bin | 110011110010000001… |
… | …0110000101000010001 |
3 | 101122000201121221100010 |
4 | 1213210002300220101 |
5 | 3310214212023441 |
6 | 123030140145133 |
7 | 11014433230461 |
oct | 1474402605021 |
9 | 348021557303 |
10 | 111200111121 |
11 | 43183622390 |
12 | 196748381a9 |
13 | a64202cb28 |
14 | 554c741ba1 |
15 | 2d5c656116 |
hex | 19e40b0a11 |
111200111121 has 8 divisors (see below), whose sum is σ = 161745616224. Its totient is φ = 67394006720.
The previous prime is 111200111107. The next prime is 111200111149. The reversal of 111200111121 is 121111002111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111200111121 - 27 = 111200110993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111200111097 and 111200111106.
It is not an unprimeable number, because it can be changed into a prime (111200111521) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1684850136 + ... + 1684850201.
It is an arithmetic number, because the mean of its divisors is an integer number (20218202028).
Almost surely, 2111200111121 is an apocalyptic number.
111200111121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111200111121 is a deficient number, since it is larger than the sum of its proper divisors (50545505103).
111200111121 is a wasteful number, since it uses less digits than its factorization.
111200111121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3369700351.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 111200111121 its reverse (121111002111), we get a palindrome (232311113232).
The spelling of 111200111121 in words is "one hundred eleven billion, two hundred million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •