Base | Representation |
---|---|
bin | 1010001100100101000001… |
… | …0000011010000111010110 |
3 | 1110200210002120122022202121 |
4 | 2203021100100122013112 |
5 | 2432141030021333420 |
6 | 35502205334530154 |
7 | 2234661156116530 |
oct | 243112020320726 |
9 | 43623076568677 |
10 | 11211211121110 |
11 | 3632714447360 |
12 | 1310983b0695a |
13 | 63429c319ab0 |
14 | 2aa8a85a2850 |
15 | 146968ec22aa |
hex | a325041a1d6 |
11211211121110 has 64 divisors (see below), whose sum is σ = 27095066901504. Its totient is φ = 3225603196800.
The previous prime is 11211211121107. The next prime is 11211211121111. The reversal of 11211211121110 is 1112111211211.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11211211121111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 559990546 + ... + 560010565.
It is an arithmetic number, because the mean of its divisors is an integer number (423360420336).
Almost surely, 211211211121110 is an apocalyptic number.
11211211121110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11211211121110 is an abundant number, since it is smaller than the sum of its proper divisors (15883855780394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11211211121110 is a wasteful number, since it uses less digits than its factorization.
11211211121110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1120001149.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 11211211121110 its reverse (1112111211211), we get a palindrome (12323322332321).
The spelling of 11211211121110 in words is "eleven trillion, two hundred eleven billion, two hundred eleven million, one hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •