Base | Representation |
---|---|
bin | 1011111011010110001000… |
… | …0000101000010010111111 |
3 | 1201102200222201100102212002 |
4 | 2332311202000220102333 |
5 | 3204330314422040121 |
6 | 43520323151132515 |
7 | 2522316410256026 |
oct | 276654200502277 |
9 | 51380881312762 |
10 | 13114179486911 |
11 | 41a6768486218 |
12 | 157974821413b |
13 | 74187b02b1a9 |
14 | 334a303218bd |
15 | 17b1e365ae0b |
hex | bed620284bf |
13114179486911 has 2 divisors, whose sum is σ = 13114179486912. Its totient is φ = 13114179486910.
The previous prime is 13114179486901. The next prime is 13114179486913. The reversal of 13114179486911 is 11968497141131.
13114179486911 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13114179486911 - 26 = 13114179486847 is a prime.
It is a super-2 number, since 2×131141794869112 (a number of 27 digits) contains 22 as substring.
Together with 13114179486913, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13114179486913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6557089743455 + 6557089743456.
It is an arithmetic number, because the mean of its divisors is an integer number (6557089743456).
Almost surely, 213114179486911 is an apocalyptic number.
13114179486911 is a deficient number, since it is larger than the sum of its proper divisors (1).
13114179486911 is an equidigital number, since it uses as much as digits as its factorization.
13114179486911 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1306368, while the sum is 56.
The spelling of 13114179486911 in words is "thirteen trillion, one hundred fourteen billion, one hundred seventy-nine million, four hundred eighty-six thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •