Base | Representation |
---|---|
bin | 1010000001100001001010… |
… | …1110110001001000101111 |
3 | 1110000121122101211002120101 |
4 | 2200120102232301020233 |
5 | 2421032404241100221 |
6 | 35235023004131531 |
7 | 2215153422055402 |
oct | 240302256611057 |
9 | 43017571732511 |
10 | 11021200331311 |
11 | 356a0792a0685 |
12 | 129bb95836ba7 |
13 | 61c3aa6aabb1 |
14 | 2a1601035d39 |
15 | 141a479c8d91 |
hex | a0612bb122f |
11021200331311 has 4 divisors (see below), whose sum is σ = 11185695858712. Its totient is φ = 10856704803912.
The previous prime is 11021200331299. The next prime is 11021200331321. The reversal of 11021200331311 is 11313300212011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11021200331311 - 211 = 11021200329263 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021200331321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82247763600 + ... + 82247763733.
It is an arithmetic number, because the mean of its divisors is an integer number (2796423964678).
Almost surely, 211021200331311 is an apocalyptic number.
11021200331311 is a deficient number, since it is larger than the sum of its proper divisors (164495527401).
11021200331311 is an equidigital number, since it uses as much as digits as its factorization.
11021200331311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164495527400.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11021200331311 its reverse (11313300212011), we get a palindrome (22334500543322).
The spelling of 11021200331311 in words is "eleven trillion, twenty-one billion, two hundred million, three hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •