Base | Representation |
---|---|
bin | 1010000110110011011101… |
… | …1110000011101100110111 |
3 | 1110100022001011011010000212 |
4 | 2201230313132003230313 |
5 | 2424024344310133421 |
6 | 35344442024300035 |
7 | 2224546664150150 |
oct | 241546736035467 |
9 | 43308034133025 |
10 | 11112011021111 |
11 | 35a4639593a40 |
12 | 12b56ba01161b |
13 | 627b20456880 |
14 | 2a5b77882927 |
15 | 1440b00dee5b |
hex | a1b37783b37 |
11112011021111 has 32 divisors (see below), whose sum is σ = 15018428845056. Its totient is φ = 7939723680000.
The previous prime is 11112011021107. The next prime is 11112011021117.
11112011021111 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11112011021111 - 22 = 11112011021107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112011021117) 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, 36606830 + ... + 36909131.
It is an arithmetic number, because the mean of its divisors is an integer number (469325901408).
Almost surely, 211112011021111 is an apocalyptic number.
11112011021111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11112011021111 is a deficient number, since it is larger than the sum of its proper divisors (3906417823945).
11112011021111 is a wasteful number, since it uses less digits than its factorization.
11112011021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73516143.
The product of its (nonzero) digits is 4, while the sum is 14.
It can be divided in two parts, 1111201 and 1021111, that multiplied together give a palindrome (1134659564311).
The spelling of 11112011021111 in words is "eleven trillion, one hundred twelve billion, eleven million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •