Base | Representation |
---|---|
bin | 1010010011101011111010… |
… | …0001101100010011011111 |
3 | 1111010110021120110202220020 |
4 | 2210322332201230103133 |
5 | 2441141114434330421 |
6 | 40034242212523223 |
7 | 2246543145325005 |
oct | 244727641542337 |
9 | 44113246422806 |
10 | 11333320230111 |
11 | 367a4858a1270 |
12 | 1330582020513 |
13 | 64295c461149 |
14 | 2b276da86a75 |
15 | 149c141dddc6 |
hex | a4ebe86c4df |
11333320230111 has 8 divisors (see below), whose sum is σ = 16484829425664. Its totient is φ = 6868678927320.
The previous prime is 11333320230101. The next prime is 11333320230119. The reversal of 11333320230111 is 11103202333311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11333320230111 - 217 = 11333320099039 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11333320230119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 171716973151 + ... + 171716973216.
It is an arithmetic number, because the mean of its divisors is an integer number (2060603678208).
Almost surely, 211333320230111 is an apocalyptic number.
11333320230111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11333320230111 is a deficient number, since it is larger than the sum of its proper divisors (5151509195553).
11333320230111 is a wasteful number, since it uses less digits than its factorization.
11333320230111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343433946381.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 11333320230111 its reverse (11103202333311), we get a palindrome (22436522563422).
The spelling of 11333320230111 in words is "eleven trillion, three hundred thirty-three billion, three hundred twenty million, two hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •