Base | Representation |
---|---|
bin | 1100000000111011100000… |
… | …0010100011001011001111 |
3 | 1201202212121102111200201001 |
4 | 3000032320002203023033 |
5 | 3212413302200030221 |
6 | 44032350340201131 |
7 | 2532253615154443 |
oct | 300167002431317 |
9 | 51685542450631 |
10 | 13210112111311 |
11 | 4233416999885 |
12 | 159425b9991a7 |
13 | 74a928c890bb |
14 | 3395310d0823 |
15 | 17d95a762391 |
hex | c03b80a32cf |
13210112111311 has 4 divisors (see below), whose sum is σ = 13235370452392. Its totient is φ = 13184853770232.
The previous prime is 13210112111227. The next prime is 13210112111327. The reversal of 13210112111311 is 11311121101231.
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 13210112111311 - 213 = 13210112103119 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 (13210112111011) 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, 12629169756 + ... + 12629170801.
It is an arithmetic number, because the mean of its divisors is an integer number (3308842613098).
Almost surely, 213210112111311 is an apocalyptic number.
13210112111311 is a deficient number, since it is larger than the sum of its proper divisors (25258341081).
13210112111311 is an equidigital number, since it uses as much as digits as its factorization.
13210112111311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25258341080.
The product of its (nonzero) digits is 36, while the sum is 19.
Adding to 13210112111311 its reverse (11311121101231), we get a palindrome (24521233212542).
The spelling of 13210112111311 in words is "thirteen trillion, two hundred ten billion, one hundred twelve million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •