Base | Representation |
---|---|
bin | 1010000000111011111101… |
… | …1101011000101101111001 |
3 | 1102222122212101111221002212 |
4 | 2200032333131120231321 |
5 | 2420401431103100241 |
6 | 35230252004104505 |
7 | 2214351063006350 |
oct | 240167735305571 |
9 | 42878771457085 |
10 | 11011213331321 |
11 | 3565913955785 |
12 | 129a069095135 |
13 | 61b4785c2948 |
14 | 2a0d348d8997 |
15 | 141660d37beb |
hex | a03bf758b79 |
11011213331321 has 8 divisors (see below), whose sum is σ = 12584537291520. Its totient is φ = 9437962742208.
The previous prime is 11011213331303. The next prime is 11011213331341. The reversal of 11011213331321 is 12313331211011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11011213331321 - 242 = 6613166820217 is a prime.
It is a super-2 number, since 2×110112133313212 (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 (11011213331341) 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, 18020801 + ... + 18621806.
It is an arithmetic number, because the mean of its divisors is an integer number (1573067161440).
Almost surely, 211011213331321 is an apocalyptic number.
It is an amenable number.
11011213331321 is a deficient number, since it is larger than the sum of its proper divisors (1573323960199).
11011213331321 is an equidigital number, since it uses as much as digits as its factorization.
11011213331321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36685543.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 11011213331321 its reverse (12313331211011), we get a palindrome (23324544542332).
The spelling of 11011213331321 in words is "eleven trillion, eleven billion, two hundred thirteen million, three hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •