Base | Representation |
---|---|
bin | 1010000111010101101111… |
… | …0001110011100011010010 |
3 | 1110101011210020212100200121 |
4 | 2201311123301303203102 |
5 | 2424202214242042320 |
6 | 35353002520540454 |
7 | 2225323645141552 |
oct | 241653361634322 |
9 | 43334706770617 |
10 | 11121210112210 |
11 | 35a852a1a7270 |
12 | 12b744692172a |
13 | 628958233543 |
14 | 2a63ab4c1162 |
15 | 14444c9e68aa |
hex | a1d5bc738d2 |
11121210112210 has 256 divisors, whose sum is σ = 23789896266240. Its totient is φ = 3711037440000.
The previous prime is 11121210112183. The next prime is 11121210112217. The reversal of 11121210112210 is 1221101212111.
It is not an unprimeable number, because it can be changed into a prime (11121210112217) by changing a digit.
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 127 ways as a sum of consecutive naturals, for example, 3657088290 + ... + 3657091330.
It is an arithmetic number, because the mean of its divisors is an integer number (92929282290).
Almost surely, 211121210112210 is an apocalyptic number.
11121210112210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11121210112210 is an abundant number, since it is smaller than the sum of its proper divisors (12668686154030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11121210112210 is a wasteful number, since it uses less digits than its factorization.
11121210112210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3278 (or 3244 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11121210112210 its reverse (1221101212111), we get a palindrome (12342311324321).
The spelling of 11121210112210 in words is "eleven trillion, one hundred twenty-one billion, two hundred ten million, one hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •