Base | Representation |
---|---|
bin | 1010000111010101010111… |
… | …0100101101011000111001 |
3 | 1110101011112021212210202122 |
4 | 2201311111310231120321 |
5 | 2424202013203210410 |
6 | 35352544551411025 |
7 | 2225321323035020 |
oct | 241652564553071 |
9 | 43334467783678 |
10 | 11121110210105 |
11 | 35a8488872345 |
12 | 12b7419383a75 |
13 | 62894062547c |
14 | 2a639c1178b7 |
15 | 144443d60e55 |
hex | a1d55d2d639 |
11121110210105 has 16 divisors (see below), whose sum is σ = 15262319597184. Its totient is φ = 7620648489600.
The previous prime is 11121110210083. The next prime is 11121110210107. The reversal of 11121110210105 is 50101201112111.
It is not a de Polignac number, because 11121110210105 - 216 = 11121110144569 is a prime.
It is a super-2 number, since 2×111211102101052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121110210107) 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 15 ways as a sum of consecutive naturals, for example, 109441292 + ... + 109542861.
It is an arithmetic number, because the mean of its divisors is an integer number (953894974824).
Almost surely, 211121110210105 is an apocalyptic number.
It is an amenable number.
11121110210105 is a deficient number, since it is larger than the sum of its proper divisors (4141209387079).
11121110210105 is a wasteful number, since it uses less digits than its factorization.
11121110210105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218985616.
The product of its (nonzero) digits is 20, while the sum is 17.
Adding to 11121110210105 its reverse (50101201112111), we get a palindrome (61222311322216).
The spelling of 11121110210105 in words is "eleven trillion, one hundred twenty-one billion, one hundred ten million, two hundred ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •