Base | Representation |
---|---|
bin | 10100101101101111… |
… | …01101101101001000 |
3 | 1001201001100112112212 |
4 | 22112313231231020 |
5 | 140234001401440 |
6 | 5035312124252 |
7 | 542406656363 |
oct | 122667555510 |
9 | 31631315485 |
10 | 11121122120 |
11 | 4797646719 |
12 | 21a4536688 |
13 | 1083055244 |
14 | 776ddd0da |
15 | 451517465 |
hex | 296dedb48 |
11121122120 has 64 divisors (see below), whose sum is σ = 25301548800. Its totient is φ = 4398956800.
The previous prime is 11121122083. The next prime is 11121122143. The reversal of 11121122120 is 2122112111.
It is a junction number, because it is equal to n+sod(n) for n = 11121122095 and 11121122104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5327717 + ... + 5329803.
It is an arithmetic number, because the mean of its divisors is an integer number (395336700).
Almost surely, 211121122120 is an apocalyptic number.
11121122120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11121122120 is an abundant number, since it is smaller than the sum of its proper divisors (14180426680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11121122120 is a wasteful number, since it uses less digits than its factorization.
11121122120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3518 (or 3514 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11121122120 its reverse (2122112111), we get a palindrome (13243234231).
It can be divided in two parts, 111211 and 22120, that added together give a palindrome (133331).
The spelling of 11121122120 in words is "eleven billion, one hundred twenty-one million, one hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •