Base | Representation |
---|---|
bin | 1100000110110011011000… |
… | …0101110000111011100111 |
3 | 1202010112001020210222021101 |
4 | 3001230312011300323213 |
5 | 3221041422322143421 |
6 | 44150554420300531 |
7 | 2542455156530101 |
oct | 301546605607347 |
9 | 52115036728241 |
10 | 13311011131111 |
11 | 4272193847851 |
12 | 15ab91a841747 |
13 | 7572b8b0b005 |
14 | 3403836d4571 |
15 | 1813b3883191 |
hex | c1b36170ee7 |
13311011131111 has 4 divisors (see below), whose sum is σ = 13311112627912. Its totient is φ = 13310909634312.
The previous prime is 13311011131097. The next prime is 13311011131129. The reversal of 13311011131111 is 11113111011331.
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 13311011131111 - 213 = 13311011122919 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 (13311011131151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50551425 + ... + 50814058.
It is an arithmetic number, because the mean of its divisors is an integer number (3327778156978).
Almost surely, 213311011131111 is an apocalyptic number.
13311011131111 is a deficient number, since it is larger than the sum of its proper divisors (101496801).
13311011131111 is a wasteful number, since it uses less digits than its factorization.
13311011131111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101496800.
The product of its (nonzero) digits is 27, while the sum is 19.
Adding to 13311011131111 its reverse (11113111011331), we get a palindrome (24424122142442).
The spelling of 13311011131111 in words is "thirteen trillion, three hundred eleven billion, eleven million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •