Base | Representation |
---|---|
bin | 1010010001110100101010… |
… | …1000100110000010001111 |
3 | 1111000101122210200001122201 |
4 | 2210131022220212002033 |
5 | 2440130041121030221 |
6 | 40011430050222331 |
7 | 2244331011314644 |
oct | 244351250460217 |
9 | 44011583601581 |
10 | 11301311111311 |
11 | 366794a552581 |
12 | 132632a2849a7 |
13 | 63c92aa7b270 |
14 | 2b0db488bdcb |
15 | 148e8e000891 |
hex | a474aa2608f |
11301311111311 has 4 divisors (see below), whose sum is σ = 12170642735272. Its totient is φ = 10431979487352.
The previous prime is 11301311111143. The next prime is 11301311111359. The reversal of 11301311111311 is 11311111310311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11301311111311 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 (11301311111011) 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, 434665811961 + ... + 434665811986.
It is an arithmetic number, because the mean of its divisors is an integer number (3042660683818).
Almost surely, 211301311111311 is an apocalyptic number.
11301311111311 is a deficient number, since it is larger than the sum of its proper divisors (869331623961).
11301311111311 is an equidigital number, since it uses as much as digits as its factorization.
11301311111311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 869331623960.
The product of its (nonzero) digits is 27, while the sum is 19.
Adding to 11301311111311 its reverse (11311111310311), we get a palindrome (22612422421622).
The spelling of 11301311111311 in words is "eleven trillion, three hundred one billion, three hundred eleven million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •