Base | Representation |
---|---|
bin | 1010000111010101101111… |
… | …1001110110011011000000 |
3 | 1110101011210101211111120101 |
4 | 2201311123321312123000 |
5 | 2424202220312033440 |
6 | 35353003034052144 |
7 | 2225324002104151 |
oct | 241653371663300 |
9 | 43334711744511 |
10 | 11121212221120 |
11 | 35a8530407771 |
12 | 12b744757a054 |
13 | 6289587c1411 |
14 | 2a63ab8ad928 |
15 | 14444ccb169a |
hex | a1d5be766c0 |
11121212221120 has 28 divisors (see below), whose sum is σ = 26482386602304. Its totient is φ = 4448484888320.
The previous prime is 11121212221037. The next prime is 11121212221159. The reversal of 11121212221120 is 2112221212111.
It is a happy number.
It is a super-2 number, since 2×111212122211202 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17376893776 + ... + 17376894415.
Almost surely, 211121212221120 is an apocalyptic number.
11121212221120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11121212221120 is an abundant number, since it is smaller than the sum of its proper divisors (15361174381184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11121212221120 is an equidigital number, since it uses as much as digits as its factorization.
11121212221120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34753788208 (or 34753788198 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 11121212221120 its reverse (2112221212111), we get a palindrome (13233433433231).
The spelling of 11121212221120 in words is "eleven trillion, one hundred twenty-one billion, two hundred twelve million, two hundred twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •