Base | Representation |
---|---|
bin | 1010000111111011000100… |
… | …1100111001101010110111 |
3 | 1110102010122210002122021220 |
4 | 2201332301030321222313 |
5 | 2424333231200304421 |
6 | 35401341250441423 |
7 | 2226130223116224 |
oct | 241766114715267 |
9 | 43363583078256 |
10 | 11131233213111 |
11 | 3601802a5a330 |
12 | 12b9383593273 |
13 | 62989494b68b |
14 | 2a6a7c73894b |
15 | 1448379193c6 |
hex | a1fb1339ab7 |
11131233213111 has 32 divisors (see below), whose sum is σ = 16586841207552. Its totient is φ = 6581587944960.
The previous prime is 11131233213077. The next prime is 11131233213119.
11131233213111 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11131233213111 - 234 = 11114053343927 is a prime.
It is a super-4 number, since 4×111312332131114 (a number of 53 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131233213119) 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, 3387730 + ... + 5808543.
It is an arithmetic number, because the mean of its divisors is an integer number (518338787736).
Almost surely, 211131233213111 is an apocalyptic number.
11131233213111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11131233213111 is a deficient number, since it is larger than the sum of its proper divisors (5455607994441).
11131233213111 is a wasteful number, since it uses less digits than its factorization.
11131233213111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9197183.
The product of its digits is 324, while the sum is 24.
It can be divided in two parts, 1113123 and 3213111, that added together give a palindrome (4326234).
The spelling of 11131233213111 in words is "eleven trillion, one hundred thirty-one billion, two hundred thirty-three million, two hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •