Base | Representation |
---|---|
bin | 1010000110110011111000… |
… | …0001101011001011000010 |
3 | 1110100022022211010200200100 |
4 | 2201230332001223023002 |
5 | 2424030110440133442 |
6 | 35344500554103230 |
7 | 2224552501141662 |
oct | 241547601531302 |
9 | 43308284120610 |
10 | 11112121021122 |
11 | 35a4695695640 |
12 | 12b572aa1ab16 |
13 | 627b3a18bc34 |
14 | 2a5b883181a2 |
15 | 1440b9abc84c |
hex | a1b3e06b2c2 |
11112121021122 has 24 divisors (see below), whose sum is σ = 26265013323120. Its totient is φ = 3367309400280.
The previous prime is 11112121021103. The next prime is 11112121021247. The reversal of 11112121021122 is 22112012121111.
It is a happy number.
It is a super-2 number, since 2×111121210211222 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11112121021095 and 11112121021104.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28060911472 + ... + 28060911867.
It is an arithmetic number, because the mean of its divisors is an integer number (1094375555130).
Almost surely, 211112121021122 is an apocalyptic number.
11112121021122 is an abundant number, since it is smaller than the sum of its proper divisors (15152892301998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112121021122 is a wasteful number, since it uses less digits than its factorization.
11112121021122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56121823358 (or 56121823355 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 11112121021122 its reverse (22112012121111), we get a palindrome (33224133142233).
The spelling of 11112121021122 in words is "eleven trillion, one hundred twelve billion, one hundred twenty-one million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •