Base | Representation |
---|---|
bin | 1010000111010101101111… |
… | …0001110000100110001110 |
3 | 1110101011210020211202002110 |
4 | 2201311123301300212032 |
5 | 2424202214241200420 |
6 | 35353002520404450 |
7 | 2225323645061355 |
oct | 241653361604616 |
9 | 43334706752073 |
10 | 11121210100110 |
11 | 35a852a199170 |
12 | 12b7446916726 |
13 | 62895822ab96 |
14 | 2a63ab4ba99c |
15 | 14444c9e2ee0 |
hex | a1d5bc7098e |
11121210100110 has 64 divisors (see below), whose sum is σ = 29263668595200. Its totient is φ = 2682502922880.
The previous prime is 11121210100097. The next prime is 11121210100111. The reversal of 11121210100110 is 1100101212111.
11121210100110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11121210100111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 84609297 + ... + 84740636.
It is an arithmetic number, because the mean of its divisors is an integer number (457244821800).
Almost surely, 211121210100110 is an apocalyptic number.
11121210100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11121210100110 is an abundant number, since it is smaller than the sum of its proper divisors (18142458495090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11121210100110 is a wasteful number, since it uses less digits than its factorization.
11121210100110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169350153.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11121210100110 its reverse (1100101212111), we get a palindrome (12221311312221).
The spelling of 11121210100110 in words is "eleven trillion, one hundred twenty-one billion, two hundred ten million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •