Base | Representation |
---|---|
bin | 1010111011001000110111… |
… | …1100111001011110000110 |
3 | 1120112020202220201020002010 |
4 | 2232302031330321132012 |
5 | 3033242223142023420 |
6 | 41313454450155050 |
7 | 2346526335262005 |
oct | 256621574713606 |
9 | 46466686636063 |
10 | 12011110111110 |
11 | 391097958a810 |
12 | 141ba00582a86 |
13 | 69184838b026 |
14 | 2d74ab352c3c |
15 | 15c6834b04e0 |
hex | aec8df39786 |
12011110111110 has 64 divisors (see below), whose sum is σ = 31465544269824. Its totient is φ = 2910092217600.
The previous prime is 12011110111073. The next prime is 12011110111201. The reversal of 12011110111110 is 1111101111021.
It is a super-2 number, since 2×120111101111102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10006534 + ... + 11142393.
It is an arithmetic number, because the mean of its divisors is an integer number (491649129216).
Almost surely, 212011110111110 is an apocalyptic number.
12011110111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12011110111110 is an abundant number, since it is smaller than the sum of its proper divisors (19454434158714).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12011110111110 is a wasteful number, since it uses less digits than its factorization.
12011110111110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21150669.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 12011110111110 its reverse (1111101111021), we get a palindrome (13122211222131).
The spelling of 12011110111110 in words is "twelve trillion, eleven billion, one hundred ten million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •