Base | Representation |
---|---|
bin | 1011111011010110101110… |
… | …1001111111000101111011 |
3 | 1201102201101222212120102011 |
4 | 2332311223221333011323 |
5 | 3204331132334320011 |
6 | 43520351211550351 |
7 | 2522323413663526 |
oct | 276655351770573 |
9 | 51381358776364 |
10 | 13114341323131 |
11 | 41a6840872164 |
12 | 157979245b3b7 |
13 | 7418a5712679 |
14 | 334a47a0bbbd |
15 | 17b202977621 |
hex | bed6ba7f17b |
13114341323131 has 16 divisors (see below), whose sum is σ = 13531336035840. Its totient is φ = 12702142889280.
The previous prime is 13114341323099. The next prime is 13114341323137. The reversal of 13114341323131 is 13132314341131.
It is a cyclic number.
It is not a de Polignac number, because 13114341323131 - 25 = 13114341323099 is a prime.
It is a super-2 number, since 2×131143413231312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13114341323093 and 13114341323102.
It is not an unprimeable number, because it can be changed into a prime (13114341323137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5074026 + ... + 7209328.
It is an arithmetic number, because the mean of its divisors is an integer number (845708502240).
Almost surely, 213114341323131 is an apocalyptic number.
13114341323131 is a deficient number, since it is larger than the sum of its proper divisors (416994712709).
13114341323131 is a wasteful number, since it uses less digits than its factorization.
13114341323131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2136426.
The product of its digits is 7776, while the sum is 31.
Adding to 13114341323131 its reverse (13132314341131), we get a palindrome (26246655664262).
The spelling of 13114341323131 in words is "thirteen trillion, one hundred fourteen billion, three hundred forty-one million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •