Base | Representation |
---|---|
bin | 1010000111010001101000… |
… | …1110000011001101011001 |
3 | 1110101001221121020001101120 |
4 | 2201310122032003031121 |
5 | 2424142441204020441 |
6 | 35352301430235453 |
7 | 2225254461205230 |
oct | 241643216031531 |
9 | 43331847201346 |
10 | 11120110220121 |
11 | 35a8015356041 |
12 | 12b719a4b5b89 |
13 | 6288113bca16 |
14 | 2a63053adb17 |
15 | 1443d6182966 |
hex | a1d1a383359 |
11120110220121 has 8 divisors (see below), whose sum is σ = 16944929859264. Its totient is φ = 6354348697200.
The previous prime is 11120110220101. The next prime is 11120110220237. The reversal of 11120110220121 is 12102201102111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11120110220121 - 214 = 11120110203737 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11120110220121.
It is not an unprimeable number, because it can be changed into a prime (11120110220101) 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, 264764529030 + ... + 264764529071.
It is an arithmetic number, because the mean of its divisors is an integer number (2118116232408).
Almost surely, 211120110220121 is an apocalyptic number.
It is an amenable number.
11120110220121 is a deficient number, since it is larger than the sum of its proper divisors (5824819639143).
11120110220121 is an equidigital number, since it uses as much as digits as its factorization.
11120110220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 529529058111.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11120110220121 its reverse (12102201102111), we get a palindrome (23222311322232).
The spelling of 11120110220121 in words is "eleven trillion, one hundred twenty billion, one hundred ten million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •