Base | Representation |
---|---|
bin | 1011111100010101001110… |
… | …1111101000101010001111 |
3 | 1201111022201022221200122122 |
4 | 2333011103233220222033 |
5 | 3210120013211120421 |
6 | 43532204145403155 |
7 | 2523456252363452 |
oct | 277052357505217 |
9 | 51438638850578 |
10 | 13131120020111 |
11 | 4202970a18585 |
12 | 1580a956394bb |
13 | 74334a900232 |
14 | 33579a161499 |
15 | 17b8859d82ab |
hex | bf153be8a8f |
13131120020111 has 8 divisors (see below), whose sum is σ = 13316504491680. Its totient is φ = 12946848969312.
The previous prime is 13131120020101. The next prime is 13131120020141. The reversal of 13131120020111 is 11102002113131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13131120020111 - 238 = 12856242113167 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13131120020111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13131120020101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 278331440 + ... + 278378613.
It is an arithmetic number, because the mean of its divisors is an integer number (1664563061460).
Almost surely, 213131120020111 is an apocalyptic number.
13131120020111 is a deficient number, since it is larger than the sum of its proper divisors (185384471569).
13131120020111 is a wasteful number, since it uses less digits than its factorization.
13131120020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 556710385.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 13131120020111 its reverse (11102002113131), we get a palindrome (24233122133242).
The spelling of 13131120020111 in words is "thirteen trillion, one hundred thirty-one billion, one hundred twenty million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •