Base | Representation |
---|---|
bin | 1011111011000111010011… |
… | …0111111101001110010101 |
3 | 1201102022201110011000211201 |
4 | 2332301310313331032111 |
5 | 3204244142424410031 |
6 | 43514424310432501 |
7 | 2522116000636111 |
oct | 276616467751625 |
9 | 51368643130751 |
10 | 13110201013141 |
11 | 41a5006764a71 |
12 | 1578a17962731 |
13 | 741395a057bb |
14 | 334773bb2741 |
15 | 17b05e238d61 |
hex | bec74dfd395 |
13110201013141 has 8 divisors (see below), whose sum is σ = 13802062380480. Its totient is φ = 12418524724608.
The previous prime is 13110201013057. The next prime is 13110201013153. The reversal of 13110201013141 is 14131010201131.
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 13110201013141 - 213 = 13110201004949 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110201013171) 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, 46124281 + ... + 46407646.
It is an arithmetic number, because the mean of its divisors is an integer number (1725257797560).
Almost surely, 213110201013141 is an apocalyptic number.
It is an amenable number.
13110201013141 is a deficient number, since it is larger than the sum of its proper divisors (691861367339).
13110201013141 is an equidigital number, since it uses as much as digits as its factorization.
13110201013141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92539403.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 13110201013141 its reverse (14131010201131), we get a palindrome (27241211214272).
The spelling of 13110201013141 in words is "thirteen trillion, one hundred ten billion, two hundred one million, thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •