Base | Representation |
---|---|
bin | 1010000111010010000011… |
… | …1000100000001011010111 |
3 | 1110101002020101120200011221 |
4 | 2201310200320200023113 |
5 | 2424143203313341434 |
6 | 35352320502311211 |
7 | 2225260316342353 |
oct | 241644070401327 |
9 | 43332211520157 |
10 | 11120222012119 |
11 | 35a8072471020 |
12 | 12b720ba28507 |
13 | 62882b60192c |
14 | 2a6316190463 |
15 | 1443e0db62b4 |
hex | a1d20e202d7 |
11120222012119 has 8 divisors (see below), whose sum is σ = 12169419905808. Its totient is φ = 10077402221760.
The previous prime is 11120222012093. The next prime is 11120222012177. The reversal of 11120222012119 is 91121022202111.
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 11120222012119 - 27 = 11120222011991 is a prime.
It is a super-2 number, since 2×111202220121192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11120222012093 and 11120222012102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120222012189) 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, 1594522182 + ... + 1594529155.
It is an arithmetic number, because the mean of its divisors is an integer number (1521177488226).
Almost surely, 211120222012119 is an apocalyptic number.
11120222012119 is a deficient number, since it is larger than the sum of its proper divisors (1049197893689).
11120222012119 is a wasteful number, since it uses less digits than its factorization.
11120222012119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3189051665.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 11120222012119 in words is "eleven trillion, one hundred twenty billion, two hundred twenty-two million, twelve thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •