Base | Representation |
---|---|
bin | 1010010011100111110010… |
… | …0010011110111110100011 |
3 | 1111010100102102021211201001 |
4 | 2210321330202132332203 |
5 | 2441131333031011121 |
6 | 40033540304052431 |
7 | 2246503543246111 |
oct | 244717442367643 |
9 | 44110372254631 |
10 | 11332213141411 |
11 | 3679a67985128 |
12 | 1330313304117 |
13 | 642813c9aa86 |
14 | 2b26a6a20ab1 |
15 | 149b9be07991 |
hex | a4e7c89efa3 |
11332213141411 has 4 divisors (see below), whose sum is σ = 11344104236952. Its totient is φ = 11320322045872.
The previous prime is 11332213141367. The next prime is 11332213141427. The reversal of 11332213141411 is 11414131223311.
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 11332213141411 - 27 = 11332213141283 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11332213141411.
It is not an unprimeable number, because it can be changed into a prime (11332213141481) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5945546341 + ... + 5945548246.
It is an arithmetic number, because the mean of its divisors is an integer number (2836026059238).
Almost surely, 211332213141411 is an apocalyptic number.
11332213141411 is a deficient number, since it is larger than the sum of its proper divisors (11891095541).
11332213141411 is an equidigital number, since it uses as much as digits as its factorization.
11332213141411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11891095540.
The product of its digits is 1728, while the sum is 28.
Adding to 11332213141411 its reverse (11414131223311), we get a palindrome (22746344364722).
The spelling of 11332213141411 in words is "eleven trillion, three hundred thirty-two billion, two hundred thirteen million, one hundred forty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •